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

DOI10.1016/J.DISC.2021.112471MaRDI QIDQ2032896zbMATH OpenOpenAlexFDO

Authors 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

coloringDP-coloringlist coloringplanar graph

Mathematics Subject Classification ID

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

Recommendations

• DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
• DP-colorings of graphs with high chromatic number
• On DP-coloring of graphs and multigraphs
• Edge DP-coloring in planar graphs
• DP-4-coloring of planar graphs with some restrictions on cycles

Cites work

• Colorings and orientations of graphs
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Every planar graph is 5-choosable
• Every planar map is four colorable. I: Discharging
• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• List colourings of planar graphs
• On DP-coloring of graphs and multigraphs
• The complexity of planar graph choosability

Cited in

(5)

• On-line DP-coloring of graphs
• DP-colorings of graphs with high chromatic number
• Separating the online and offline DP-chromatic numbers
• Hyperbolicity theorems for correspondence colouring
• Some orientation theorems for restricted DP-colorings of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2032896)