Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
From MaRDI portal
Publication:1045155
DOI10.1016/J.DISC.2009.08.005zbMath1228.05131OpenAlexW2043040176MaRDI QIDQ1045155
Ming Chen, Hua Jing Lu, Ying Qian Wang
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.08.005
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (5)
Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs ⋮ Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable ⋮ Some structural properties of planar graphs and their applications to 3-choosability ⋮ \((1,0,0)\)-colorability of planar graphs without prescribed short cycles ⋮ DP-3-coloring of planar graphs without certain cycles
Cites Work
- Unnamed Item
- Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
- List colourings of planar graphs
- A note on the not 3-choosability of some families of planar graphs
- On 3-colorable plane graphs without 5- and 7-cycles
- A non-3-choosable planar graph without cycles of length 4 and 5
- Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable
- The complexity of planar graph choosability
- Colorings and orientations of graphs
- Every planar graph is 5-choosable
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- The 3-choosability of plane graphs of girth 4
- 3-list-coloring planar graphs of girth 5
- A sufficient condition for a planar graph to be 3-choosable
- A note on 3-choosability of planar graphs
- On 3-colorable planar graphs without prescribed cycles
- Bordeaux 3-color conjecture and 3-choosability
- A note on 3-choosability of planar graphs without certain cycles
This page was built for publication: Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
