Edge DP-coloring in planar graphs

DOI10.1016/J.DISC.2021.112314zbMath1460.05069OpenAlexW3129121342MaRDI QIDQ2659224

You Lu, Li Zhang, Sheng Gui Zhang

Publication date: 25 March 2021

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

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

zbMATH Keywords

edge coloringplanar graphedge list coloringedge DP-coloring

Mathematics Subject Classification ID

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

Cites Work

• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• List edge and list total colorings of planar graphs without 4-cycles
• Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
• List edge and list total colourings of multigraphs
• List-edge-coloring of planar graphs without 6-cycles with three chords
• Edge choosability of planar graphs without small cycles
• Choosability, edge choosability and total choosability of outerplane graphs
• The list chromatic index of a bipartite multigraph
• Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable
• Some upper bounds on the total and list chromatic numbers of multigraphs
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge DP-coloring in planar graphs