Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
From MaRDI portal
Publication:1981692
DOI10.1016/j.disc.2021.112564zbMath1472.05044OpenAlexW3195972519MaRDI QIDQ1981692
Pongpat Sittitrai, Kittikorn Nakprasit
Publication date: 6 September 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112564
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)
Related Items (2)
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
- Unnamed Item
- Unnamed Item
- Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
- 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
- The 3-choosability of plane graphs of girth 4
- 3-list-coloring planar graphs of girth 5
- DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
- 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
This page was built for publication: Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate