A note on the not 3-choosability of some families of planar graphs
From MaRDI portal
Publication:845679
DOI10.1016/j.ipl.2005.10.014zbMath1184.05048OpenAlexW2159607383MaRDI QIDQ845679
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.10.014
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (13)
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs ⋮ Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains ⋮ A sufficient condition for a planar graph to be 3-choosable ⋮ A note on 3-choosability of planar graphs ⋮ 3-Paintability of planar graphs ⋮ Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable ⋮ Colouring of generalized signed triangle-free planar graphs ⋮ The 4-choosability of planar graphs and cycle adjacency ⋮ On 3-choosability of planar graphs without certain cycles ⋮ A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable ⋮ A refinement of choosability of graphs ⋮ Multiple list colouring triangle free planar graphs ⋮ Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
Cites Work
- A non-3-choosable planar graph without cycles of length 4 and 5
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- Smaller planar triangle-free graphs that are not 3-list-colorable
- 3-list-coloring planar graphs of girth 5
- A not 3-choosable planar graph without 3-cycles
- A note on 3-choosability of planar graphs without certain cycles
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- 25 pretty graph colouring problems
This page was built for publication: A note on the not 3-choosability of some families of planar graphs
