scientific article; zbMATH DE number 7771726

zbMath1527.05044MaRDI QIDQ6072035

Mao Zhang, Xiangwen Li

Publication date: 29 November 2023

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/87/ajc_v87_p086.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

DP-coloringplanar graphs without \(k\)-cycles

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

• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• DP-3-coloring of some planar graphs
• Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
• A sufficient condition for DP-4-colorability
• DP-4-coloring of planar graphs with some restrictions on cycles
• DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
• Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
• DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles
• DP-4-colorability of planar graphs without adjacent cycles of given length
• DP-4-colorability of two classes of planar graphs
• On DP-coloring of graphs and multigraphs
• DP-colorings of graphs with high chromatic number
• The asymptotic behavior of the correspondence chromatic number
• The Johansson‐Molloy theorem for DP‐coloring

This page was built for publication: