On 3-choosability of planar graphs without certain cycles

DOI10.1016/J.IPL.2008.01.008zbMath1185.05070OpenAlexW2092178654MaRDI QIDQ963411

Haihui Zhang, Zhi-ren Sun

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.01.008

zbMATH Keywords

cyclecombinatorial problemsplanar graphchoosabilitylist assignment

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

DP-3-coloring of planar graphs without certain cycles

Cites Work

• List colourings of planar graphs
• Planar graphs without cycles of specific lengths
• A note on the not 3-choosability of some families of planar graphs
• The complexity of planar graph choosability
• Colorings and orientations of graphs
• The 4-choosability of plane graphs without 4-cycles
• Every planar graph is 5-choosable
• Choosability and edge choosability of planar graphs without five cycles
• The 3-choosability of plane graphs of girth 4
• 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
• A note on 3-choosability of planar graphs
• Bordeaux 3-color conjecture and 3-choosability
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• \((4m,m)\)-choosability of plane graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On 3-choosability of planar graphs without certain cycles