DeepAI AI Chat
Log In Sign Up

Exact square coloring of subcubic planar graphs *

by   Florent Foucaud, et al.

We study the exact square chromatic number of subcubic planar graphs. An exact square coloring of a graph G is a vertex-coloring in which any two vertices at distance exactly 2 receive distinct colors. The smallest number of colors used in such a coloring of G is its exact square chromatic number, denoted χ^♯ 2(G). This notion is related to other types of distance-based colorings, as well as to injective coloring. Indeed, for triangle-free graphs, exact square coloring and injective coloring coincide. We prove tight bounds on special subclasses of planar graphs: subcubic bipartite planar graphs and subcubic K 4-minor-free graphs have exact square chromatic number at most 4. We then turn our attention to the class of fullerene graphs, which are cubic planar graphs with face sizes 5 and 6. We characterize fullerene graphs with exact square chromatic number 3. Furthermore, supporting a conjecture of Chen, Hahn, Raspaud and Wang (that all subcubic planar graphs are injectively 5-colorable) we prove that any induced subgraph of a fullerene graph has exact square chromatic number at most 5. This is done by first proving that a minimum counterexample has to be on at most 80 vertices and then computationally verifying the claim for all such graphs.


page 1

page 2

page 3

page 4


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...

Computing Square Colorings on Bounded-Treewidth and Planar Graphs

A square coloring of a graph G is a coloring of the square G^2 of G, tha...

Distance-Two Colorings of Barnette Graphs

Barnette identified two interesting classes of cubic polyhedral graphs f...

Coloring a Dominating Set Without Conflicts: q-Subset Square Coloring

The Square Colouring of a graph G refers to colouring of vertices of a g...

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

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

Approximate and exact results for the harmonious chromatic number

Graph colorings is a fundamental topic in graph theory that require an a...

Hierarchical Colorings of Cographs

Cographs are exactly hereditarily well-colored graphs, i.e., the graphs ...