Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable

DOI10.1016/J.IPL.2009.08.004zbMATH Open1197.05050OpenAlexW1966005013MaRDI QIDQ990957FDOQ990957

Authors: Hervé Hocquard, Mickaël Montassier 

Publication date: 1 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.08.004

Recommendations

• Acyclic choosability of planar graphs: a Steinberg like approach
• Planar graphs without 4-cycles are acyclically 6-choosable
• Acyclic 4-choosability of planar graphs
• Acyclic 5-choosability of planar graphs without small cycles
• A note on the acyclic 3-choosability of some planar graphs

zbMATH Keywords

planar graphscombinatorial problemsforbidden cyclesacyclic choosability

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• On acyclic colorings of planar graphs
• Acyclic 4-choosability of planar graphs withot cycles of specific lengths
• Every planar graph is 5-choosable
• 25 pretty graph colouring problems
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• A non-3-choosable planar graph without cycles of length 4 and 5
• Acyclic 4-choosability of planar graphs with girth at least 5
• Acyclic list 7‐coloring of planar graphs
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11
• On the acyclic choosability of graphs

Cited In (10)

• Planar graphs without 4- and 5-cycles are acyclically 4-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 3-choosability of planar graphs without cycles of length from 4 to 12
• Acyclic 4-choosability of planar graphs
• Acyclic 5-choosability of planar graphs without adjacent short cycles
• 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
• Acyclic 3-choosability of sparse graphs with girth at least 7

This page was built for publication: Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable

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