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

Xuan Hoang La (1) , Petru Valicov (1)

1 LIRMM | ALGCO - Algorithmes, Graphes et Combinatoire

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.

Domaines: Mathématique discrète [cs.DM]; Combinatoire [math.CO]

Xuan Hoang La, Petru Valicov. Computer assisted discharging procedure on planar graphs: application to 2-distance coloring. 2022. ⟨hal-03576729⟩