Planar graphs without normally adjacent short cycles
From MaRDI portal
Publication:2144582
DOI10.1016/j.disc.2022.112986zbMath1498.05102arXiv1908.04902OpenAlexW3186340785MaRDI QIDQ2144582
Mengjiao Rao, Tao Wang, Fangyao Lu, Qianqian Wang
Publication date: 14 June 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.04902
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Weak degeneracy of planar graphs without 4- and 6-cycles ⋮ A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles ⋮ DP-4-coloring of planar graphs with some restrictions on cycles
Cites Work
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Planar graphs without short even cycles are near-bipartite
- Decomposing a planar graph of girth 5 into an independent set and a forest
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
- Every planar graph is 5-choosable
- DP-3-coloring of some planar graphs
- 3-list-coloring planar graphs of girth 5
- Colorings of plane graphs: a survey
- DP-4-coloring of planar graphs with some restrictions on cycles
- DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
- Cover and variable degeneracy
- An extension of Thomassen's result on choosability
- DP-4-colorability of planar graphs without adjacent cycles of given length
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
- Every planar graph without adjacent cycles of length at most 8 is 3-choosable
- DP-4-colorability of two classes of planar graphs
- On 3-colorable planar graphs without cycles of four lengths
- On 3-colorable planar graphs without prescribed cycles
- Planar graphs without 4, 6, 8-cycles are 3-colorable
- 3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles
- A note on a Brooks' type theorem for DP‐coloring
This page was built for publication: Planar graphs without normally adjacent short cycles
