Acyclic 5-choosability of planar graphs without small cycles
From MaRDI portal
Publication:3427375
DOI10.1002/jgt.20206zbMath1114.05037OpenAlexW4239028730MaRDI QIDQ3427375
Mickaël Montassier, Wei Fan Wang, Andre Raspaud
Publication date: 20 March 2007
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20206
Related Items (23)
A sufficient condition for planar graphs to be acyclically 5-choosable ⋮ Acyclic 5-choosability of planar graphs without adjacent short cycles ⋮ Acyclic coloring of graphs without bichromatic long path ⋮ Acyclic 4-choosability of planar graphs ⋮ An improved upper bound for the acyclic chromatic number of 1-planar graphs ⋮ Acyclic 4-choosability of planar graphs without intersecting short cycles ⋮ Planar graphs without 4- and 5-cycles are acyclically 4-choosable ⋮ Every toroidal graph is acyclically 8-choosable ⋮ Acyclic 6-choosability of planar graphs without adjacent short cycles ⋮ Acyclic 4-choosability of planar graphs without 4-cycles ⋮ Acyclic 5-choosability of planar graphs without 4-cycles ⋮ Acyclic 5-choosability of planar graphs without 4-cycles ⋮ Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles ⋮ Acyclic 3-choosability of sparse graphs with girth at least 7 ⋮ What is on his mind? ⋮ 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 ⋮ A polyhedral study of the acyclic coloring problem ⋮ On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9 ⋮ Unnamed Item ⋮ Planar graphs without 4-cycles are acyclically 6-choosable ⋮ Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
This page was built for publication: Acyclic 5-choosability of planar graphs without small cycles
