scientific article; zbMATH DE number 2097483

zbMath1047.05014MaRDI QIDQ4812233

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

Publication date: 7 September 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

connected graphthree colour problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (max. 100)

Further extensions of the Grötzsch theorem ⋮ 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 ⋮ 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: