Continuation of a 3-coloring from a 7-face onto a plane graph without \(C_3\)

zbMath1077.05039MaRDI QIDQ2577175

Oleg V. Borodin, Valerii A. Aksenov, Alekseĭ Nikolaevich Glebov

Publication date: 19 December 2005

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/51859

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (max. 100)

Further extensions of the Grötzsch theorem ⋮ Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains ⋮ Characterization of 4-critical triangle-free toroidal graphs ⋮ 3-coloring triangle-free planar graphs with a precolored 9-cycle ⋮ 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle ⋮ A step towards the strong version of Havel's three color conjecture ⋮ Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five ⋮ Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable ⋮ Planar 4-critical graphs with four triangles ⋮ Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable

This page was built for publication: Continuation of a 3-coloring from a 7-face onto a plane graph without \(C_3\)