A sufficient condition for planar graphs to be DP-4-colorable

DOI10.2989/16073606.2022.2122890zbMath1528.05023MaRDI QIDQ6075728

Xiaoxia Zhang, Ziwen Huang, Jian-Qing Ma

Publication date: 20 September 2023

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

zbMATH Keywords

planar graph\(L\)-coloringmatching assignment\textit{DP}-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
• Unnamed Item
• A sufficient condition for a planar graph to be 4-choosable
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• List colourings of planar graphs
• Planar graphs without cycles of specific lengths
• Planar graphs without 4-cycles adjacent to triangles are 4-choosable
• The 4-choosability of plane graphs without 4-cycles
• Choosability and edge choosability of planar graphs without five cycles
• Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
• A sufficient condition for DP-4-colorability
• Colorings of plane graphs: a survey
• DP-4-coloring of planar graphs with some restrictions on cycles
• Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable
• Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
• DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles
• Planar graphs without 7-cycles and butterflies are DP-4-colorable
• DP-4-colorability of planar graphs without adjacent cycles of given length
• DP-4-colorability of two classes of planar graphs
• Planar graphs without intersecting 5-cycles are 4-choosable
• Planar graphs without triangular 4-cycles are 3-choosable
• Planar Graphs without 7-Cycles Are 4-Choosable
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles