Acyclic 6-choosability of planar graphs without adjacent short cycles
From MaRDI portal
Publication:476645
DOI10.1007/s11425-013-4572-6zbMath1299.05137OpenAlexW2113729506MaRDI QIDQ476645
Ge Zhang, Min Chen, Wei Fan Wang
Publication date: 2 December 2014
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-013-4572-6
Related Items (6)
Acyclic 4-choosability of planar graphs without intersecting short cycles ⋮ Acyclic 4-choosability of planar graphs without 4-cycles ⋮ Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 ⋮ On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9 ⋮ Unnamed Item ⋮ Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acyclic 4-choosability of planar graphs
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
- Acyclic 4-choosability of planar graphs without adjacent short 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
- Note to the paper of Grünbaum on acyclic colorings
- Every planar graph has an acyclic 7-coloring
- On acyclic colorings of planar graphs
- Every planar graph is 5-choosable
- Every planar graph has an acyclic 8-coloring
- Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable
- A sufficient condition for planar graphs to be acyclically 5-choosable
- Acyclic 5-choosability of planar graphs without adjacent short cycles
- Acyclic 5-choosability of planar graphs without small cycles
- Planar graphs without 4-cycles are acyclically 6-choosable
- Acyclic Colourings of Planar Graphs with Large Girth
- 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
This page was built for publication: Acyclic 6-choosability of planar graphs without adjacent short cycles
