List coloring of planar graphs with forbidden cycles

DOI10.1016/J.ENDM.2016.10.030zbMath1356.05050OpenAlexW2554514991WikidataQ62045765 ScholiaQ62045765MaRDI QIDQ510959

Meghana Nasre, Sreekanth Gorla

Publication date: 14 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.10.030

zbMATH Keywords

planar graphslist coloringdischarging method

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

• Colorings and orientations of graphs
• Every planar graph is 5-choosable
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• Unnamed Item
• Unnamed Item

This page was built for publication: List coloring of planar graphs with forbidden cycles