Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles

DOI10.1016/J.DISC.2010.07.001MaRDI QIDQ710596zbMATH OpenOpenAlexFDO

Authors Anna O. Ivanova, Oleg V. Borodin, André Raspaud

Publication date 19 October 2010

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2010.07.001

zbMATH Keywords

planar graphacyclic coloringacyclic choosability

Mathematics Subject Classification ID

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

Recommendations

• Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic 4-choosability of planar graphs without adjacent short cycles
• Planar graphs without 4- and 5-cycles are acyclically 4-choosable
• On acyclic 4-choosability of planar graphs without short cycles

Cites work

• scientific article; zbMATH DE number 434910 (Why is no real title available?)
• scientific article; zbMATH DE number 54790 (Why is no real title available?)
• scientific article; zbMATH DE number 3565019 (Why is no real title available?)
• scientific article; zbMATH DE number 3639666 (Why is no real title available?)
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• 25 pretty graph colouring problems
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles
• Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11
• Acyclic 3-choosability of planar graphs without cycles of length from 4 to 12
• Acyclic 3-choosability of sparse graphs with girth at least 7
• Acyclic 4-choosability of planar graphs with girth at least 5
• Acyclic 4-choosability of planar graphs withot cycles of specific lengths
• Acyclic 4-colorability of planar graphs without cycles of length 4 or 6
• Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic 5-choosability of planar graphs without small cycles
• Acyclic Colourings of Planar Graphs with Large Girth
• Acyclic colorings of planar graphs
• Acyclic list 7‐coloring of planar graphs
• Every planar graph has an acyclic 7-coloring
• Every planar graph has an acyclic 8-coloring
• Every planar graph is 5-choosable
• Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
• List colourings of planar graphs
• Note to the paper of Grünbaum on acyclic colorings
• On acyclic colorings of planar graphs
• 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

Cited in

(18)

• scientific article; zbMATH DE number 6914816 (Why is no real title available?)
• A sufficient condition for planar graphs to be acyclically 5-choosable
• Planar graphs without 4- and 5-cycles are acyclically 4-choosable
• Acyclic 4-colorability of planar graphs without cycles of length 4 or 6
• Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
• On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
• Acyclic 4-choosability of planar graphs without 4-cycles.
• Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11
• Acyclic 6-choosability of planar graphs without adjacent short cycles
• Acyclic 4-choosability of planar graphs
• Acyclic 4-choosability of planar graphs without adjacent short cycles
• Acyclic 5-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-choosability of planar graphs without intersecting short cycles
• Planar graphs without chordal 6-cycles are 4-choosable
• Acyclic 3-choosability of sparse graphs with girth at least 7
• Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles

This page was built for publication: Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles

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