A note on 3-choosability of planar graphs
From MaRDI portal
Publication:2380076
DOI10.1016/J.IPL.2007.08.027zbMATH Open1183.05023OpenAlexW2015744567MaRDI QIDQ2380076FDOQ2380076
Authors: Ming Chen, Yingqian 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
Recommendations
- A note on 3-choosability of planar graphs without certain cycles
- Some structural properties of planar graphs and their applications to 3-choosability
- Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
- A note on 3-choosability of planar graphs
- A note on 3-choosability of planar graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Every planar graph is 5-choosable
- List colourings of planar graphs
- The complexity of planar graph choosability
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- A non-3-choosable planar graph without cycles of length 4 and 5
- A sufficient condition for a planar graph to be 3-choosable
- A note on 3-choosability of planar graphs without certain cycles
- A note on the not 3-choosability of some families of planar graphs
- Bordeaux 3-color conjecture and 3-choosability
Cited In (26)
- Title not available (Why is that?)
- A note on 3-choosability of planar graphs without certain cycles
- DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
- 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart
- 3-paintability of planar graphs
- Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
- Title not available (Why is that?)
- Planar graphs that have non short cycles with a chord are 3-choosable
- Title not available (Why is that?)
- Note on 3-choosability of planar graphs with maximum degree 4
- A note on 3-choosability of planar graphs
- A note on 3-choosability of planar graphs
- A note on 3-choosability of planar graphs related to Montanssier's conjecture
- The 3-choosability of plane graphs without 3-,6-,9-and 10-cycles
- A note on the not 3-choosability of some families of planar graphs
- On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
- A note on choosability with separation for planar graphs.
- A non-3-choosable planar graph without cycles of length 4 and 5
- 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
- On 3-choosability of planar graphs without certain cycles
- On 3-choosability of planar graphs without certain cycles
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
- DP-3-coloring of planar graphs without certain cycles
- Planar graphs without specific cycles are 2-degenerate
This page was built for publication: A note on 3-choosability of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380076)
