Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable
From MaRDI portal
Publication:2671068
DOI10.3934/math.2021593OpenAlexW3181991456MaRDI QIDQ2671068
Publication date: 3 June 2022
Published in: AIMS Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/math.2021593
Cites Work
- Unnamed Item
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- DP-3-coloring of some planar graphs
- A sufficient condition for DP-4-colorability
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- 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\}\)
- Relaxed equitable colorings of planar graphs with girth at least 8
- 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
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable
- On DP-coloring of graphs and multigraphs
- DP-colorings of graphs with high chromatic number
- 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart
- Planar graphs without 4, 6, 8-cycles are 3-colorable
- The asymptotic behavior of the correspondence chromatic number
- Sharp Dirac's theorem for DP‐critical graphs
This page was built for publication: Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable