A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable

DOI10.1016/J.IPL.2008.04.004zbMath1189.05066OpenAlexW2090111770MaRDI QIDQ975410

De-Qiang Wang, Yu-Peng Wen, Ke-Lun Wang

Publication date: 9 June 2010

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

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

zbMATH Keywords

combinatorial problemsplanar graphlist coloring3-choosable

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs ⋮ On Choosability with Separation of Planar Graphs with Forbidden Cycles

Cites Work

• List colourings of planar graphs
• A note on the not 3-choosability of some families of planar graphs
• Smaller planar triangle-free graphs that are not 3-list-colorable
• A not 3-choosable planar graph without 3-cycles
• Bordeaux 3-color conjecture and 3-choosability
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable