Planar graphs without adjacent cycles of length at most seven are 3-colorable
type: Item
instance of: scholarly article
title: Planar graphs without adjacent cycles of length at most seven are 3-colorable
zbMATH Open document ID: 1221.05071
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5648183
zbMATH Keywords: the 3-color problem
author: Oleg V. Borodin
author: Mickaël Montassier
author: André Raspaud
MaRDI profile type: Publication
full work available at URL: j.disc.2009.08.010
OpenAlex ID: W2071241856
cites work: Q4000782
cites work: Some counterexamples associated with the three-color problem
cites work: Every planar map is four colorable. I: Discharging
cites work: Every planar map is four colorable. II: Reducibility
cites work: Q4374713
cites work: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
cites work: Q4811813
cites work: Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
cites work: Planar graphs without cycles of length from 4 to 7 are 3-colorable
cites work: A sufficient condition for planar graphs to be 3-colorable
cites work: Some simplified NP-complete graph problems
cites work: On a conjecture of B. Grünbaum
cites work: A relaxation of Havel's 3-color problem
cites work: A note on the three color problem
cites work: Q3139765
cites work: A 3-color theorem on plane graphs without 5-circuits
DOI: 10.1016/J.DISC.2009.08.010
description: scientific article; zbMATH DE number 5648183