The 3-choosability of plane graphs of girth 4
From MaRDI portal
Publication:1781982
DOI10.1016/J.DISC.2004.10.023zbMATH Open1062.05061OpenAlexW2127485656MaRDI QIDQ1781982FDOQ1781982
P. C. B. Lam, Wai Chee Shiu, Zengmin Song
Publication date: 10 June 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.10.023
Recommendations
- On 3-choosability of plane graphs of girth no less than 4 without 7-, 8- and 15-cycles
- The 3-choosability of special plane graphs with girth of 4 at least
- The choosability of some 4-reduced plane graphs
- A not 3-choosable planar graph without 3-cycles
- On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Every planar graph is 5-choosable
- 3-list-coloring planar graphs of girth 5
- Title not available (Why is that?)
- Colorings and orientations of graphs
- List colourings of planar graphs
- The complexity of planar graph choosability
- A not 3-choosable planar graph without 3-cycles
Cited In (10)
- A sufficient condition for a planar graph to be 3-choosable
- DP-3-coloring of some planar graphs
- Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
- On \((k, k n - k^2 - 2 k - 1)\)-choosability of \(n\)-vertex graphs
- Bordeaux 3-color conjecture and 3-choosability
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
- 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: The 3-choosability of plane graphs of girth 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781982)
