DeepAI AI Chat
Log In Sign Up

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

by   Hoang La, et al.

A 2-distance k-coloring of a graph is a proper vertex k-coloring where vertices at distance at most 2 cannot share the same color. We prove the existence of a 2-distance 4-coloring for planar subcubic graphs with girth at least 21. We also show a construction of a planar subcubic graph of girth 11 that is not 2-distance 4-colorable.


page 1

page 2

page 3

page 4


2-distance (Δ+2)-coloring of sparse graphs

A 2-distance k-coloring of a graph is a proper k-coloring of the vertice...

Odd coloring of two subclasses of planar graphs

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

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

Using computational techniques we provide a framework for proving result...

Exact square coloring of subcubic planar graphs *

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

Linear-time algorithm for vertex 2-coloring without monochromatic triangles on planar graphs

In the problem of 2-coloring without monochromatic triangles (or triangl...

Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model

In this paper, we consider distributed coloring for planar graphs with a...

Square coloring planar graphs with automatic discharging

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