scientific article; zbMATH DE number 1882353

zbMATH Open1008.05064MaRDI QIDQ4797465FDOQ4797465

Authors: Valerii A. Aksenov, Oleg V. Borodin, A. N. Glebov 

Publication date: 16 March 2003

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2097483
• On 3-colorable planar graphs without prescribed cycles
• On 3-colorable planar graphs without short cycles
• On 3-colorability of planar graphs without adjacent short cycles
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
• A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles
• On 3-colorable planar graphs without cycles of four lengths
• On 3-colorable plane graphs without 5- and 7-cycles
• A NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLES
• On 3-colorings of plane graphs

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)

Cited In (9)

• Title not available (Why is that?)
• Splitting a planar graph of girth 5 into two forests with trees of small diameter
• Extending partial 3-colourings in a planar graph
• Continuation of a 3-coloring from a 7-face onto a plane graph without \(C_3\)
• 3-coloring triangle-free planar graphs with a precolored 9-cycle
• Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
• A step towards the strong version of Havel's three color conjecture
• Short proofs of coloring theorems on planar graphs
• A characterization of small 3-colorable graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4797465)