Publication:4374713
From MaRDI portal
zbMath0881.05037MaRDI QIDQ4374713
Publication date: 25 January 1998
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
(\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6, 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, Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable, Planar graphs without adjacent cycles of length at most seven are 3-colorable, A step towards the strong version of Havel's three color conjecture, Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests, A note on 3-choosability of planar graphs without certain cycles