Further extensions of the Grötzsch Theorem

The Grötzsch Theorem states that every triangle-free planar graph admits a proper 3-coloring. Among many of its generalizations, the one of Grünbaum and Aksenov, giving 3-colorability of planar graphs with at most three triangles, is perhaps the most known. A lot of attention was also given to extending 3-colorings of subgraphs to the whole graph. In this paper, we consider 3-colorings of planar graphs with at most one triangle. Particularly, we show that precoloring of any two non-adjacent vertices and precoloring of a face of length at most 4 can be extended to a 3-coloring of the graph. Additionally, we show that for every vertex of degree at most 3, a precoloring of its neighborhood with the same color extends to a 3coloring of the graph. The latter result implies an affirmative answer to a conjecture on adynamic coloring. All the presented results are tight.

[1]  Alexandr V. Kostochka,et al.  A Brooks-Type Result for Sparse Critical Graphs , 2014, Comb..

[2]  K. Appel,et al.  Every planar map is four colorable. Part II: Reducibility , 1977 .

[3]  David P. Dailey.  Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete , 1980, Discret. Math..

[4]  Krzysztof Diks,et al.  A New 3-Color Criterion for Planar Graphs , 2002, WG.

[5]  K. Appel,et al.  Every planar map is four colorable. Part I: Discharging , 1977 .

[6]  Mária Maceková,et al.  Note on 3-choosability of planar graphs with maximum degree 4 , 2019, Discret. Math..

[7]  R. Steinberg.  The State of the Three Color Problem , 1993 .

[8]  K. Appel,et al.  Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.

[9]  Zdenek Dvorak,et al.  3-Coloring Triangle-Free Planar Graphs with a Precolored 8-Cycle , 2015, J. Graph Theory.

[10]  Bernard Lidický,et al.  3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle , 2014, IWOCA.

[11]  André Raspaud,et al.  Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable , 2009, J. Comb. Theory, Ser. B.

[12]  Daniel Král,et al.  Steinberg's Conjecture is false , 2017, J. Comb. Theory, Ser. B.

[13]  Alexandr V. Kostochka,et al.  Ore’s conjecture for k=4 and Grötzsch’s Theorem , 2014, Combinatorica.

[14]  Carsten Thomassen,et al.  Coloring graphs with fixed genus and girth , 1997 .

[15]  Oleg V. Borodin,et al.  Colorings of plane graphs: A survey , 2013, Discret. Math..

[16]  Martin Kochol.  Three colorability characterized by shrinking of locally connected subgraphs into triangles , 2018, Inf. Process. Lett..

[17]  Emanuel Wenger,et al.  Colorability of Planar Graphs with Isolated Nontriangular Faces , 2004, Graphs Comb..

[18]  Mária Šurimová,et al.  Adynamic coloring of graphs , 2020, Discret. Appl. Math..

[19]  Daniel Kral,et al.  Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies , 2021, J. Comb. Theory, Ser. B.

[20]  Alexandr V. Kostochka,et al.  Planar 4-critical graphs with four triangles , 2014, Eur. J. Comb..

[21]  Alexandr V. Kostochka,et al.  Short proofs of coloring theorems on planar graphs , 2014, Eur. J. Comb..

[22]  Robin Thomas,et al.  Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm , 2016, J. Comb. Theory, Ser. B.

[23]  Branko Grünbaum.  Grötzsch's theorem on $3$-colorings. , 1963 .

[24]  Oleg V. Borodin.  A new proof of Grünbaum's 3 color theorem , 1997, Discret. Math..

[25]  Carsten Thomassen,et al.  The color space of a graph , 2000, J. Graph Theory.