Computer assisted discharging procedure on planar graphs: application to 2-distance coloring
Combinatorics
2022-02-15 v2 Discrete Mathematics
Abstract
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 of girth at least 8 has 2-distance chromatic number at most 6.
Keywords
Cite
@article{arxiv.2202.03885,
title = {Computer assisted discharging procedure on planar graphs: application to 2-distance coloring},
author = {Hoang La and Petru Valicov},
journal= {arXiv preprint arXiv:2202.03885},
year = {2022}
}