On 3-choosable planar graphs of girth at least 4
From MaRDI portal
Publication:1025501
DOI10.1016/J.DISC.2008.05.055zbMATH Open1221.05150OpenAlexW1984035914MaRDI QIDQ1025501FDOQ1025501
Authors: Xiangwen Li 
Publication date: 19 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.05.055
Recommendations
- 3-list-coloring planar graphs of girth 4
- On 3-choosability of plane graphs of girth no less than 4 without 7-, 8- and 15-cycles
- The 3-choosability of plane graphs without 3-,6-,9-and 10-cycles
- Planar graphs without intersecting 5-cycles are 4-choosable
- The 4-choosability of plane graphs without 4-cycles
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Every planar graph is 5-choosable
- A short list color proof of Grötzsch's theorem
- 3-list-coloring planar graphs of girth 5
- Grötzsch's theorem on 3-colorings
- Title not available (Why is that?)
- Multicriterial graph problems with MAXMIN criterion
- Colorings and orientations of graphs
- List colourings of planar graphs
- The complexity of planar graph choosability
- Hajós' theorem for list coloring
- The 4-choosability of plane graphs without 4-cycles
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
- A not 3-choosable planar graph without 3-cycles
- Smaller planar triangle-free graphs that are not 3-list-colorable
- On structure of some plane graphs with application to choosability
- Bordeaux 3-color conjecture and 3-choosability
Cited In (2)
This page was built for publication: On 3-choosable planar graphs of girth at least 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025501)
