Acyclic 4-colorability of planar graphs without cycles of length 4 or 6

zbMATH Open1249.05108MaRDI QIDQ3115199FDOQ3115199

Authors: Oleg V. Borodin 

Publication date: 20 February 2012

Recommendations

• Acyclic 4-coloring of planar graphs without 4- and 5-cycles
• Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
• Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
• Planar graphs without 4-cycles are acyclically 6-choosable
• Acyclic 4-choosability of planar graphs without adjacent short cycles

zbMATH Keywords

planar graphacyclic coloringlist acyclic coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cited In (14)

• The \(r\)-acyclic chromatic number of planar graphs
• Acyclically 4-colorable triangulations
• A sufficient condition for planar graphs to be acyclically 5-choosable
• Planar graphs without 4- and 5-cycles are acyclically 4-choosable
• Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
• On acyclically 4-colorable maximal planar graphs
• 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
• Acyclic 5-choosability of planar graphs without 4-cycles
• On acyclic 4-choosability of planar graphs without short cycles
• Acyclic 4-coloring of planar graphs without 4- and 5-cycles
• \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)
• Acyclic 3-choosability of sparse graphs with girth at least 7

This page was built for publication: Acyclic 4-colorability of planar graphs without cycles of length 4 or 6

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115199)