Acyclic list 7‐coloring of planar graphs
From MaRDI portal
Publication:4539872
DOI10.1002/JGT.10035zbMATH Open1004.05029OpenAlexW2077544347MaRDI QIDQ4539872FDOQ4539872
Authors: Éric Sopena, Oleg V. Borodin, Dmitry G. Fon-Der-Flaass, Alexandr Kostochka, André Raspaud 
Publication date: 11 July 2002
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10035
Cites Work
Cited In (38)
- Improved bounds on linear coloring of plane graphs
- A polyhedral study of the acyclic coloring problem
- A polyhedral study of the acyclic coloring problem
- A sufficient condition for planar graphs to be acyclically 5-choosable
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable
- A Conjecture of Borodin and a Coloring of Grünbaum
- Planar graphs without 4-cycles are acyclically 6-choosable
- A note on the acyclic 3-choosability of some planar graphs
- Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
- Acyclic improper choosability of graphs
- On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
- Acyclic coloring of graphs without bichromatic long path
- Acyclic colorings of subcubic graphs
- Acyclic choosability of graphs with bounded degree
- Acyclic 4-choosability of planar graphs without 4-cycles.
- Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
- Acyclic 6-choosability of planar graphs without adjacent short cycles
- Acyclic vertex coloring of graphs of maximum degree 5
- Every toroidal graph is acyclically 8-choosable
- Acyclic 4-choosability of planar graphs
- Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable
- Acyclic 5-choosability of planar graphs without adjacent short cycles
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
- What is on his mind?
- Acyclic 4-choosability of planar graphs without adjacent short cycles
- Acyclic 5-choosability of planar graphs without 4-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 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
- Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
- Acyclic choosability of planar graphs: a Steinberg like approach
- Linear choosability of graphs
- Linear coloring of planar graphs with large girth
- An introduction to the discharging method via graph coloring
- Acyclic 3-choosability of sparse graphs with girth at least 7
- Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles
- Title not available (Why is that?)
This page was built for publication: Acyclic list 7‐coloring of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4539872)
