Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles
From MaRDI portal
Publication:2042281
DOI10.1007/s10114-021-9335-7zbMath1469.05060OpenAlexW3173586617MaRDI QIDQ2042281
Publication date: 28 July 2021
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-021-9335-7
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Acyclic 6-choosability of planar graphs without adjacent short cycles
- Acyclic 4-choosability of planar graphs
- List colourings of planar graphs
- A note on the acyclic 3-choosability of some planar graphs
- Acyclic 3-choosability of sparse graphs with girth at least 7
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
- Acyclic 4-choosability of planar graphs without adjacent short cycles
- Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11
- Note to the paper of Grünbaum on acyclic colorings
- On acyclic colorings of planar graphs
- Every planar graph is 5-choosable
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable
- Every toroidal graph is acyclically 8-choosable
- Acyclic 5-choosability of planar graphs without adjacent short cycles
- Planar graphs without 4-cycles are acyclically 6-choosable
- Acyclic list 7‐coloring of planar graphs
- Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles
- Acyclic 5-choosability of planar graphs without 4-cycles
- Acyclic 5-choosability of planar graphs without 4-cycles
- Acyclic colorings of planar graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles
