DOIAbstract
AbstractWe give a short proof of the result that every planar graph of girth 5 is 3-choosable and hence also of Grötzsch's theorem saying that every planar triangle-free graph is 3-colorable
AbstractWe give a short proof of the result that every planar graph of girth 5 is 3-choosable and hence also of Grötzsch's theorem saying that every planar triangle-free graph is 3-colorable
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
AbstractSteinberg's question from 1975 whether every planar graph without 4- and 5-cycles is 3-color...
AbstractWe prove that every planar graph of girth at least 5 is 3-choosable. It is even possible to ...
AbstractWe prove that every planar graph of girth at least 5 is 3-choosable. It is even possible to ...
AbstractWe give a short proof of the result that every planar graph of girth 5 is 3-choosable and he...
A graph G is k-choosable if every vertex of G can be properly colored whenever every vertex has a li...
AbstractA graph G is k-choosable if every vertex of G can be properly colored whenever every vertex ...
AbstractGrötzsch proved that every planar triangle-free graph is 3-colorable. We prove that it has a...
A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey y...
A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey y...
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 paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-c...
AbstractIn the course of extending Grötzsch’s Theorem, we prove that every triangle-free graph witho...
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
AbstractSteinberg's question from 1975 whether every planar graph without 4- and 5-cycles is 3-color...
AbstractWe prove that every planar graph of girth at least 5 is 3-choosable. It is even possible to ...
AbstractWe prove that every planar graph of girth at least 5 is 3-choosable. It is even possible to ...
AbstractWe give a short proof of the result that every planar graph of girth 5 is 3-choosable and he...
A graph G is k-choosable if every vertex of G can be properly colored whenever every vertex has a li...
AbstractA graph G is k-choosable if every vertex of G can be properly colored whenever every vertex ...
AbstractGrötzsch proved that every planar triangle-free graph is 3-colorable. We prove that it has a...
A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey y...
A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey y...
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 paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-c...
AbstractIn the course of extending Grötzsch’s Theorem, we prove that every triangle-free graph witho...
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
AbstractSteinberg's question from 1975 whether every planar graph without 4- and 5-cycles is 3-color...
Add to ORKG