Acyclic 4-choosability of planar graphs without intersecting short cycles
From MaRDI portal
Publication:4603881
DOI10.1142/S1793830918500143zbMath1380.05081OpenAlexW2777669211MaRDI QIDQ4603881
Min Chen, Dong Chen, Yingcai Sun
Publication date: 23 February 2018
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830918500143
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items
Acyclic 4-choosability of planar graphs without 4-cycles, On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
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
- On acyclic colorings of planar graphs
- Every planar graph has an acyclic 8-coloring
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable
- 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 Colourings of Planar Graphs with Large Girth
- Acyclic list 7‐coloring of planar graphs
- Acyclic 5-choosability of planar graphs without 4-cycles
- Acyclic 5-choosability of planar graphs without 4-cycles
- Acyclic colorings of planar graphs