A note on 3-choosability of planar graphs
From MaRDI portal
Publication:2380076
DOI10.1016/j.ipl.2007.08.027zbMath1183.05023OpenAlexW2015744567MaRDI QIDQ2380076
Ming Chen, Ying Qian Wang, Hua Jing Lu
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.08.027
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (10)
Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable ⋮ Corrigendum to ``On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles ⋮ Some structural properties of planar graphs and their applications to 3-choosability ⋮ Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate ⋮ DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\) ⋮ On 3-choosability of planar graphs without certain cycles ⋮ DP-3-coloring of planar graphs without certain cycles ⋮ Planar graphs without specific cycles are 2-degenerate ⋮ On the 3-colorability of planar graphs without 4-, 7- and 9-cycles ⋮ Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
Cites Work
- Unnamed Item
- Unnamed Item
- List colourings of planar graphs
- A note on the not 3-choosability of some families of planar graphs
- A non-3-choosable planar graph without cycles of length 4 and 5
- The complexity of planar graph choosability
- Every planar graph is 5-choosable
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- A sufficient condition for a planar graph to be 3-choosable
- Bordeaux 3-color conjecture and 3-choosability
- 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
This page was built for publication: A note on 3-choosability of planar graphs
