Acyclic 4-choosability of planar graphs without 4-cycles
From MaRDI portal
Publication:3297010
DOI10.21136/CMJ.2019.0197-18OpenAlexW2974798965MaRDI QIDQ3297010
Publication date: 2 July 2020
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.21136/cmj.2019.0197-18
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acyclic 6-choosability of planar graphs without adjacent short cycles
- Acyclic 4-choosability of planar graphs
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
- On acyclic 4-choosability of planar graphs without short cycles
- Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
- Every planar graph has an acyclic 7-coloring
- Every planar graph has an acyclic 8-coloring
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable
- On acyclic colorings of planar graphs. (Reprint)
- A sufficient condition for planar graphs to be acyclically 5-choosable
- Acyclic 5-choosability of planar graphs without small cycles
- Planar graphs without 4-cycles are acyclically 6-choosable
- Acyclic list 7‐coloring of planar graphs
- Acyclic 4-choosability of planar graphs without intersecting short cycles
- Acyclic 5-choosability of planar graphs without 4-cycles
- Acyclic 5-choosability of planar graphs without 4-cycles
- Acyclic colorings of planar graphs
This page was built for publication: Acyclic 4-choosability of planar graphs without 4-cycles