Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11

zbMath1329.05101MaRDI QIDQ890814

Oleg V. Borodin, Anna O. Ivanova

Publication date: 16 November 2015

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: http://semr.math.nsc.ru/v7/p275-283.pdf

zbMATH Keywords

planar graphacyclic coloringforbidden cycles

Mathematics Subject Classification ID

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

Related Items (14)

A sufficient condition for planar graphs to be acyclically 5-choosable ⋮ Acyclic 5-choosability of planar graphs without adjacent short cycles ⋮ Acyclic 4-choosability of planar graphs ⋮ Planar graphs without 4- and 5-cycles are acyclically 4-choosable ⋮ List 2-facial 5-colorability of plane graphs with girth at least 12 ⋮ Acyclic 5-choosability of planar graphs without 4-cycles ⋮ Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles ⋮ A Complexity Dichotomy for the Coloring of Sparse Graphs ⋮ A note on the acyclic 3-choosability of some planar graphs ⋮ Acyclic 3-choosability of sparse graphs with girth at least 7 ⋮ Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles ⋮ Acyclic 4-choosability of planar graphs without adjacent short cycles ⋮ Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable ⋮ Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles

This page was built for publication: Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11