Planar graphs having no cycle of length 4, 7, or 9 are DP-3-colorable

DOI10.1002/JGT.23123zbMATH Open1547.05096MaRDI QIDQ6606324FDOQ6606324

Authors: Yingli Kang, Li-Gang Jin, Xuding Zhu 

Publication date: 16 September 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

zbMATH Keywords

planar graphsshort cyclesdischargingDP-coloring\(S\)-\(k\)-coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
• 3-list-coloring planar graphs of girth 5
• On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
• The 3-colorability of planar graphs without cycles of length 4, 6 and 9
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Steinberg's conjecture is false
• DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
• Planar graphs without 4, 6, 8-cycles are 3-colorable
• A NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLES
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Colouring of \(S\)-labelled planar graphs
• Plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles are 3-colorable
• Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable
• DP-3-coloring of some planar graphs
• DP-3-coloring of planar graphs without certain cycles
• Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable

This page was built for publication: Planar graphs having no cycle of length 4, 7, or 9 are DP-3-colorable

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