Planar graphs without 4- and 5-cycles are acyclically 4-choosable
type: Item
instance of: scholarly article
title: Planar graphs without 4- and 5-cycles are acyclically 4-choosable
zbMATH Open document ID: 1262.05029
author: Min Chen
author: André Raspaud
published in: Discrete Applied Mathematics
publication date: 2013-04-25T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6157655
zbMATH Keywords: planar graphs
zbMATH Keywords: acyclic coloring
zbMATH Keywords: choosability
zbMATH Keywords: cycle
MaRDI profile type: Publication
full work available at URL: j.dam.2012.11.006
OpenAlex ID: W2087399690
cites work: Every planar graph has an acyclic 7-coloring
cites work: On acyclic colorings of planar graphs
cites work: Q3115193
cites work: Q3115199
cites work: Q3115212
cites work: Acyclic 3-choosability of sparse graphs with girth at least 7
cites work: Acyclic list 7‐coloring of planar graphs
cites work: Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11
cites work: Acyclic 4-choosability of planar graphs without adjacent short cycles
cites work: Acyclic 5-choosability of planar graphs without adjacent short cycles
cites work: Acyclic 5-choosability of planar graphs without 4-cycles
cites work: Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
cites work: Acyclic Colourings of Planar Graphs with Large Girth
cites work: On acyclic 4-choosability of planar graphs without short cycles
cites work: A sufficient condition for planar graphs to be acyclically 5-choosable
cites work: Acyclic 4-choosability of planar graphs
cites work: Acyclic colorings of planar graphs
cites work: Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
cites work: Q4857375
cites work: Q4200238
cites work: Note to the paper of Grünbaum on acyclic colorings
cites work: Every planar graph has an acyclic 8-coloring
cites work: Q3424787
cites work: On the acyclic choosability of graphs
cites work: Q3424893
cites work: Acyclic 5-choosability of planar graphs without small cycles
cites work: Every planar graph is 5-choosable
cites work: A non-3-choosable planar graph without cycles of length 4 and 5
cites work: Planar graphs without 4-cycles are acyclically 6-choosable
cites work: Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
DOI: 10.1016/J.DAM.2012.11.006
description: scientific article; zbMATH DE number 6157655