Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate

DOI10.1016/j.disc.2022.112942zbMath1496.05037OpenAlexW4225280509MaRDI QIDQ2144489

Pongpat Sittitrai, Kittikorn Nakprasit

Publication date: 14 June 2022

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

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

zbMATH Keywords

planar graphdischarging method3-degenerate graphs

Mathematics Subject Classification ID

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

Related Items (3)

Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles ⋮ Weak degeneracy of planar graphs without 4- and 6-cycles ⋮ A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles

Cites Work

• Planar graphs without cycles of specific lengths
• Choosability and edge choosability of planar graphs without five cycles
• A sufficient condition for DP-4-colorability
• DP-4-colorability of planar graphs without adjacent cycles of given length
• DP-4-colorability of two classes of planar graphs

This page was built for publication: Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate