DeepAI AI Chat

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

02/08/2022

∙

by Hoang La, et al.

∙

∙

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.

Hoang La
10 publications
Petru Valicov
5 publications

page 1

page 2

page 3

page 4

∙ 06/07/2021

2-distance 4-coloring of planar subcubic graphs with girth at least 21

A 2-distance k-coloring of a graph is a proper vertex k-coloring where v...

0 Hoang La, et al. ∙

∙ 05/19/2022

Odd coloring of two subclasses of planar graphs

A proper coloring of a graph is odd if every non-isolated vertex has som...

0 Mengke Qi, et al. ∙

∙ 09/02/2020

Exact square coloring of subcubic planar graphs *

We study the exact square chromatic number of subcubic planar graphs. An...

0 Florent Foucaud, et al. ∙

∙ 04/12/2022

Square coloring planar graphs with automatic discharging

The discharging method is a powerful proof technique, especially for gra...

0 Nicolas Bousquet, et al. ∙

∙ 07/28/2021

On fractional version of oriented coloring

We introduce the fractional version of oriented coloring and initiate it...

0 Sandip Das, et al. ∙

∙ 06/21/2022

A Study of Weisfeiler-Leman Colorings on Planar Graphs

The Weisfeiler-Leman (WL) algorithm is a combinatorial procedure that co...

0 Sandra Kiefer, et al. ∙

∙ 08/25/2023

Unlocking the Performance of Proximity Sensors by Utilizing Transient Histograms

We provide methods which recover planar scene geometry by utilizing the ...

0 Carter Sifferman, et al. ∙