Planar graphs without specific cycles are 2-degenerate
From MaRDI portal
Publication:2037563
DOI10.1016/J.DISC.2021.112488zbMATH Open1467.05046OpenAlexW3171363478MaRDI QIDQ2037563FDOQ2037563
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
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- 3-list-coloring planar graphs of girth 5
- Choosability and edge choosability of planar graphs without five cycles
- DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
- Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
- Planar graphs without cycles of specific lengths
- A sufficient condition for a planar graph to be 3-choosable
- A note on 3-choosability of planar graphs
- A note on 3-choosability of planar graphs without certain cycles
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- The 3-choosability of plane graphs of girth 4
- On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles
- DP-3-coloring of some planar graphs
- DP-4-colorability of planar graphs without adjacent cycles of given length
Cited In (6)
- 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
- Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate
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)
