scientific article; zbMATH DE number 1882353

zbMath1008.05064MaRDI QIDQ4797465

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

Publication date: 16 March 2003

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

zbMATH Keywords

color space of a graphGrötzsch's theorem on 3-coloringGrünbaum's 3-color theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (max. 100)

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 ⋮ Short proofs of coloring theorems on planar graphs ⋮ Splitting a planar graph of girth 5 into two forests with trees of small diameter ⋮ Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable

This page was built for publication: