A sufficient condition for planar graphs to be acyclically 5-choosable

DOI10.1002/JGT.20604zbMATH Open1242.05089OpenAlexW1684925218MaRDI QIDQ2888884FDOQ2888884

Authors: Min Chen, André Raspaud 

Publication date: 4 June 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20604

Recommendations

• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic 5-choosability of planar graphs without small cycles
• scientific article; zbMATH DE number 6914816
• Acyclic 4-choosability of planar graphs without intersecting short cycles
• Acyclic 4-choosability of planar graphs without 4-cycles.

zbMATH Keywords

planar graphacyclic coloringintersecting trianglesacyclic choosability

Mathematics Subject Classification ID

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

Cites Work

• Note to the paper of Grünbaum on acyclic colorings
• On acyclic colorings of planar graphs
• Acyclic 4-colorability of planar graphs without cycles of length 4 or 6
• Acyclic Colourings of Planar Graphs with Large Girth
• Acyclic colorings of planar graphs
• Every planar graph is 5-choosable
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• Every planar graph has an acyclic 7-coloring
• Every planar graph has an acyclic 8-coloring
• Title not available (Why is that?)
• Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
• Acyclic 5-choosability of planar graphs without small cycles
• Planar graphs without 4-cycles are acyclically 6-choosable
• Acyclic list 7‐coloring of planar graphs
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic 4-choosability of planar graphs
• Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
• On acyclic 4-choosability of planar graphs without short cycles
• Acyclic 4-coloring of planar graphs without 4- and 5-cycles
• Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11

Cited In (16)

• Construction of acyclically 4-colourable planar triangulations with minimum degree 4
• Planar graphs without 4- and 5-cycles are acyclically 4-choosable
• Acyclic 5-choosability of planar graphs without small cycles
• Locally planar graphs are 5-choosable
• Title not available (Why is that?)
• On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
• Acyclic coloring of graphs without bichromatic long path
• Acyclic choosability of graphs with bounded degree
• Acyclic 6-choosability of planar graphs without adjacent short cycles
• Acyclic 4-choosability of planar graphs without adjacent short cycles
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic 5-choosability of planar graphs without 4-cycles
• Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
• Acyclic 4-choosability of planar graphs without intersecting short cycles
• Acyclic 4-choosability of planar graphs without 4-cycles
• Title not available (Why is that?)

This page was built for publication: A sufficient condition for planar graphs to be acyclically 5-choosable

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