scientific article; zbMATH DE number 2097035

zbMath1045.05041MaRDI QIDQ4811813

Alekseĭ Nikolaevich Glebov, Oleg V. Borodin

Publication date: 6 September 2004

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

zbMATH Keywords

graph coloring3-coloring problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (max. 100)

A step towards the strong version of Havel's three color conjecture ⋮ Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable ⋮ Distance constraints on short cycles for 3-colorability of planar graphs ⋮ Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable ⋮ Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable ⋮ A structural theorem on embedded graphs and its application to colorings ⋮ Planar graphs without adjacent cycles of length at most seven are 3-colorable ⋮ A relaxation of the Bordeaux conjecture

This page was built for publication: