Add to ORKGIn this article, we show that there exists an integer k(Sigma) greater than or equal to 5 such that, if G is a graph embedded in a surface Sigma without i-circuits, 4 less than or equal to i less than or equal to k(Sigma), then G is 3-colorable. (C) 2000 John Wiley & Sons. Inc
In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable
AbstractIn this note, it is proved that every plane graph without 5- and 7-cycles and without adjace...
Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize...
AbstractEvery graph embedded on a surface of positive genus with every face bounded by an even numbe...
AbstractEvery graph embedded on a surface of positive genus with every face bounded by an even numbe...
The Four Color Theorem is equivalent with its dual form stating that each 2-edge-connected 3-regular...
AbstractIn 1976, Steinberg conjectured that plane graphs without cycles of length 4 and 5 are 3-colo...
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
AbstractA simple proof of Grünbaum's theorem on the 3-colourability of planar graphs having at most ...
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
AbstractIn this paper, we mainly prove that planar graphs without 4-, 7- and 9-cycles are 3-colorabl...
AbstractPlanar graphs without cycles of length from 4 to 7 are proved to be 3-colorable. Moreover, i...
AbstractPlanar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be...
In the first partial result toward Steinberg's now-disproved three coloring conjecture, Abbott and Z...
In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable
In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable
AbstractIn this note, it is proved that every plane graph without 5- and 7-cycles and without adjace...
Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize...
AbstractEvery graph embedded on a surface of positive genus with every face bounded by an even numbe...
AbstractEvery graph embedded on a surface of positive genus with every face bounded by an even numbe...
The Four Color Theorem is equivalent with its dual form stating that each 2-edge-connected 3-regular...
AbstractIn 1976, Steinberg conjectured that plane graphs without cycles of length 4 and 5 are 3-colo...
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
AbstractA simple proof of Grünbaum's theorem on the 3-colourability of planar graphs having at most ...
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
AbstractIn this paper, we mainly prove that planar graphs without 4-, 7- and 9-cycles are 3-colorabl...
AbstractPlanar graphs without cycles of length from 4 to 7 are proved to be 3-colorable. Moreover, i...
AbstractPlanar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be...
In the first partial result toward Steinberg's now-disproved three coloring conjecture, Abbott and Z...
In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable
In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable
AbstractIn this note, it is proved that every plane graph without 5- and 7-cycles and without adjace...
Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize...