Weak degeneracy of planar graphs without 4- and 6-cycles

DOI10.1016/j.dam.2023.03.025zbMath1512.05114arXiv2303.13267OpenAlexW4360882206MaRDI QIDQ6157423

No author found.

Publication date: 11 May 2023

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

Full work available at URL: https://arxiv.org/abs/2303.13267

zbMATH Keywords

weak degeneracydegenerate graphDP-coloringnear-bipartite

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles

Cites Work

• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Planar graphs without cycles of specific lengths
• Choosability and edge choosability of planar graphs without five cycles
• DP-3-coloring of some planar graphs
• Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
• DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
• DP-3-coloring of planar graphs without certain cycles
• Planar graphs without specific cycles are 2-degenerate
• Cover and variable degeneracy
• Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate
• Planar graphs without normally adjacent short cycles
• DP-4-colorability of planar graphs without adjacent cycles of given length
• Weak degeneracy of graphs

This page was built for publication: Weak degeneracy of planar graphs without 4- and 6-cycles