On 3-choosability of plane graphs without 6-, 7- and 9-cycles

DOI10.1007/s11766-004-0028-7zbMath1045.05047OpenAlexW2087244870MaRDI QIDQ1430647

Haihui Zhang, Bao-Gang Xu

Publication date: 27 May 2004

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-004-0028-7

zbMATH Keywords

vertex coloringchoice number

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Choice numbers of multi-bridge graphs ⋮ On \((k, k n - k^2 - 2 k - 1)\)-choosability of \(n\)-vertex graphs ⋮ DP-3-coloring of planar graphs without certain cycles ⋮ Weak type \((H^1,L^1)\) estimate for commutator of Marcinkiewicz integral ⋮ Planar graphs without 3-, 7-, and 8-cycles are 3-choosable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• Colorings and orientations of graphs
• The 4-choosability of plane graphs without 4-cycles
• Every planar graph is 5-choosable
• On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability
• A note on the three color problem
• On structure of some plane graphs with application to choosability
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• \((4m,m)\)-choosability of plane graphs

This page was built for publication: On 3-choosability of plane graphs without 6-, 7- and 9-cycles