Computer assisted discharging procedure on planar graphs: application to 2-distance coloring

Autor:	La, Hoang, Valicov, Petru
Rok vydání:	2022
Předmět:	Mathematics - Combinatorics Computer Science - Discrete Mathematics
Druh dokumentu:	Working Paper
Popis:	Using computational techniques we provide a framework for proving results on subclasses of planar graphs via discharging method. The aim of this paper is to apply these techniques to study the 2-distance coloring of planar subcubic graphs. Applying these techniques we show that every subcubic planar graph $G$ of girth at least 8 has 2-distance chromatic number at most 6.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2202.03885 Zobrazit plný text záznamu View this record from Arxiv