scientific article; zbMATH DE number 1109403
From MaRDI portal
Publication:4374713
zbMath0881.05037MaRDI QIDQ4374713
Publication date: 25 January 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (9)
(\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6 ⋮ A step towards the strong version of Havel's three color conjecture ⋮ Unnamed Item ⋮ Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests ⋮ 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 note on 3-choosability of planar graphs without certain cycles
This page was built for publication: