A step towards the strong version of Havel's three color conjecture
type: Item
instance of: scholarly article
title: A step towards the strong version of Havel's three color conjecture
zbMATH Open document ID: 1256.05068
author: Oleg V. Borodin
author: T. R. Jensen
author: A. N. Glebov
published in: Journal of Combinatorial Theory. Series B
publication date: 2013-01-14T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 6125257
zbMATH Keywords: plane graph
zbMATH Keywords: coloring
zbMATH Keywords: three color problem
MaRDI profile type: Publication
full work available at URL: j.jctb.2012.08.001
OpenAlex ID: W2068629692
cites work: Q4000782
cites work: Q4193485
cites work: Q4797465
cites work: Q4812233
cites work: Continuation of a 3-coloring from a 7-face onto a plane graph without \(C_3\)
cites work: Some counterexamples associated with the three-color problem
cites work: Q4374713
cites work: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
cites work: Q4797463
cites work: Q4811813
cites work: Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
cites work: Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
cites work: Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
cites work: Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
cites work: Planar graphs without cycles of length from 4 to 7 are 3-colorable
cites work: Planar graphs without adjacent cycles of length at most seven are 3-colorable
cites work: A sufficient condition for planar graphs to be 3-colorable
cites work: Three-coloring planar graphs without short cycles
cites work: On 3-colorable planar graphs without short cycles
cites work: Some simplified NP-complete graph problems
cites work: Coloring graphs with fixed genus and girth
cites work: On a conjecture of B. Grünbaum
cites work: The color space of a graph
cites work: On 3-colorable planar graphs without cycles of four lengths
cites work: A note on the three color problem
cites work: Q3139765
cites work: Planar graphs without 4, 6, 8-cycles are 3-colorable
cites work: On 3-colorable planar graphs without prescribed cycles
cites work: On 3-colorability of planar graphs without adjacent short cycles
cites work: On 3-colorable plane graphs without 5- and 7-cycles
cites work: A 3-color theorem on plane graphs without 5-circuits
DOI: 10.1016/J.JCTB.2012.08.001
description: scientific article; zbMATH DE number 6125257