Planar graphs without specific cycles are 2-degenerate

DOI10.1016/J.DISC.2021.112488MaRDI QIDQ2037563zbMATH OpenOpenAlexFDO

Authors Patcharapan Jumnongnit, Wannapol Pimpasalee

Publication date 8 July 2021

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

planar graph2-degenerate graphforbidden cycle3-choosability

Mathematics Subject Classification ID

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

Recommendations

• Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
• Decomposing a planar graph into degenerate graphs
• Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate
• Maximum 4-degenerate subgraph of a planar graph
• Planar graphs without cycles of specific lengths

Cites work

• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• 3-list-coloring planar graphs of girth 5
• A note on 3-choosability of planar graphs
• A note on 3-choosability of planar graphs without certain cycles
• A sufficient condition for a planar graph to be 3-choosable
• Choosability and edge choosability of planar graphs without five cycles
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
• DP-3-coloring of some planar graphs
• DP-4-colorability of planar graphs without adjacent cycles of given length
• On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles
• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
• Planar graphs without cycles of specific lengths
• The 3-choosability of plane graphs of girth 4

Cited in

(6)

• Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate
• Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
• Induced 2-degenerate subgraphs of triangle-free planar graphs
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles
• Decomposing a planar graph into degenerate graphs
• Weak degeneracy of planar graphs without 4- and 6-cycles

This page was built for publication: Planar graphs without specific cycles are 2-degenerate

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