On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
type: Item
instance of: scholarly article
title: On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
zbMATH Open document ID: 1209.05092
author: Yuehua Bu
author: Hua Jing Lu
author: Yingqian Wang
author: Weifan Wang
author: Mickaël Montassier
author: André Raspaud
published in: Discrete Mathematics
publication date: 2009-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 5644980
zbMATH Keywords: planar graphs
zbMATH Keywords: cycles
zbMATH Keywords: extendability
zbMATH Keywords: coloring
MaRDI profile type: Publication
full work available at URL: j.disc.2009.02.030
OpenAlex ID: W2055901320
cites work: Q4000782
cites work: Q5422499
cites work: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
cites work: Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
cites work: Planar graphs without cycles of length from 4 to 7 are 3-colorable
cites work: Three-coloring planar graphs without short cycles
cites work: 25 pretty graph colouring problems
cites work: On 3-colorable planar graphs without cycles of four lengths
cites work: A note on the three color problem
cites work: A sufficient condition for a planar graph to be 3-choosable
cites work: Q3139765
cites work: Planar graphs without 4, 6, 8-cycles are 3-colorable
cites work: A note on 3-choosability of planar graphs
cites work: Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
cites work: On 3-colorable plane graphs without 5- and 7-cycles
cites work: A note on 3-choosability of planar graphs without certain cycles
DOI: 10.1016/J.DISC.2009.02.030
description: scientific article; zbMATH DE number 5644980