The 3-choosability of plane graphs of girth 4

DOI10.1016/j.disc.2004.10.023zbMath1062.05061OpenAlexW2127485656MaRDI QIDQ1781982

Wai Chee Shiu, Zeng Min Song, Peter Che Bor Lam

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

zbMATH Keywords

Plane graphChoosabilityReduced subgraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (10)

DP-3-coloring of some planar graphs ⋮ A sufficient condition for a planar graph to be 3-choosable ⋮ 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 ⋮ On 3-choosability of planar graphs without certain cycles ⋮ Bordeaux 3-color conjecture and 3-choosability ⋮ DP-3-coloring of planar graphs without certain cycles ⋮ Planar graphs without specific cycles are 2-degenerate ⋮ Planar graphs without 3-, 7-, and 8-cycles are 3-choosable ⋮ Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• The complexity of planar graph choosability
• Colorings and orientations of graphs
• Every planar graph is 5-choosable
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles

This page was built for publication: The 3-choosability of plane graphs of girth 4