Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
From MaRDI portal
Publication:710596
DOI10.1016/J.DISC.2010.07.001zbMATH Open1209.05063OpenAlexW2052789275MaRDI QIDQ710596FDOQ710596
Oleg V. Borodin, André Raspaud, Anna O. Ivanova
Publication date: 19 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.07.001
Recommendations
- Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
- Acyclic 5-choosability of planar graphs without 4-cycles
- Acyclic 4-choosability of planar graphs without adjacent short cycles
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable
- On acyclic 4-choosability of planar graphs without short cycles
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Note to the paper of Grünbaum on acyclic colorings
- On acyclic colorings of planar graphs
- Title not available (Why is that?)
- Acyclic 4-choosability of planar graphs withot cycles of specific lengths
- Acyclic Colourings of Planar Graphs with Large Girth
- Title not available (Why is that?)
- Acyclic colorings of planar graphs
- Every planar graph is 5-choosable
- 25 pretty graph colouring problems
- 3-list-coloring planar graphs of girth 5
- Title not available (Why is that?)
- List colourings of planar graphs
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- Title not available (Why is that?)
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- Every planar graph has an acyclic 7-coloring
- Every planar graph has an acyclic 8-coloring
- Title not available (Why is that?)
- Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
- Acyclic 4-choosability of planar graphs with girth at least 5
- Acyclic 5-choosability of planar graphs without small cycles
- Acyclic list 7‐coloring of planar graphs
- Acyclic 5-choosability of planar graphs without 4-cycles
- Acyclic 3-choosability of sparse graphs with girth at least 7
- Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11
- Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
- A not 3-choosable planar graph without 3-cycles
- Title not available (Why is that?)
Cited In (16)
- A sufficient condition for planar graphs to be acyclically 5-choosable
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable
- On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
- Acyclic 6-choosability of planar graphs without adjacent short cycles
- Acyclic 4-choosability of planar graphs
- Acyclic 5-choosability of planar graphs without adjacent short cycles
- Acyclic 4-choosability of planar graphs without adjacent short cycles
- Acyclic 5-choosability of planar graphs without 4-cycles
- On acyclic 4-choosability of planar graphs without short cycles
- Acyclic 4-choosability of planar graphs without intersecting short cycles
- Acyclic 4-choosability of planar graphs without 4-cycles
- Planar graphs without chordal 6-cycles are 4-choosable
- Acyclic 3-choosability of sparse graphs with girth at least 7
- Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles
- Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles
- Title not available (Why is that?)
This page was built for publication: Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710596)
