The 4-choosability of planar graphs and cycle adjacency

DOI10.1016/j.disc.2021.112587zbMath1472.05053OpenAlexW3194201783MaRDI QIDQ1981715

Chung-Ying Yang, Juei-Yin Lin, Gerard Jennhwa Chang

Publication date: 6 September 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112587

zbMATH Keywords

cycleplanar graphchoosabilitytheta graphsun

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• Planar graphs without cycles of specific lengths
• Planar graphs without 4-cycles adjacent to triangles are 4-choosable
• A note on the not 3-choosability of some families of planar 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
• On structure of some plane graphs with application to choosability
• Planar Graphs without 7-Cycles Are 4-Choosable
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

This page was built for publication: The 4-choosability of planar graphs and cycle adjacency