Differences between the list-coloring and DP-coloring for planar graphs

DOI10.1016/j.disc.2021.112471zbMath1466.05060OpenAlexW3161266958MaRDI QIDQ2032896

Toshiki Abe

Publication date: 14 June 2021

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

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

zbMATH Keywords

planar graphcoloringlist coloringDP-coloring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• List colourings of planar graphs
• The complexity of planar graph choosability
• Colorings and orientations of graphs
• Every planar map is four colorable. I: Discharging
• Every planar graph is 5-choosable
• On DP-coloring of graphs and multigraphs

This page was built for publication: Differences between the list-coloring and DP-coloring for planar graphs