Work

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

Year: 2025

Type: article

Abstract: 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. Comment: 21 pages, 14 figures

Source: Discrete Mathematics & Theoretical Computer Science

DOI: 10.46298/dmtcs.7563

Authors: Hoang La, Mickael Montassier

Language: English

Topic: Graph Labeling and Dimension Problems

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W4287124341

FWCI:

Cites:

Cited by: 3

Related to: 10