DOIAbstract
AbstractSteinberg's question from 1975 whether every planar graph without 4- and 5-cycles is 3-colorable is still open. In this paper the analogous question for 3-choosability of such graphs is answered to the negative
AbstractSteinberg's question from 1975 whether every planar graph without 4- and 5-cycles is 3-colorable is still open. In this paper the analogous question for 3-choosability of such graphs is answered to the negative
AbstractWe prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3≤i≤j...
AbstractPlanar graphs without cycles of length from 4 to 7 are proved to be 3-colorable. Moreover, i...
AbstractWe prove that every planar graph of girth at least 5 is 3-choosable. It is even possible to ...
AbstractA graph G is k-choosable if every vertex of G can be properly colored whenever every vertex ...
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
A graph G is k-choosable if every vertex of G can be properly colored whenever every vertex has a li...
AbstractAn L-list coloring of a graph G is a proper vertex coloring in which every vertex v receives...
AbstractPlanar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be...
AbstractIn this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-c...
AbstractIn this paper, we mainly prove that planar graphs without 4-, 7- and 9-cycles are 3-colorabl...
In 2018, Dvořák and Postle introduced DP-coloring and proved that planar graphs without cycles of le...
AbstractIn this article, we consider planar graphs in which each vertex is not incident to some cycl...
AbstractSteinberg asked whether every planar graph without 4 and 5 cycles is 3-colorable. Borodin, a...
AbstractIn this note, it is proved that every plane graph without 5- and 7-cycles and without adjace...
AbstractWe prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3≤i≤j...
AbstractPlanar graphs without cycles of length from 4 to 7 are proved to be 3-colorable. Moreover, i...
AbstractWe prove that every planar graph of girth at least 5 is 3-choosable. It is even possible to ...
AbstractA graph G is k-choosable if every vertex of G can be properly colored whenever every vertex ...
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
A graph G is k-choosable if every vertex of G can be properly colored whenever every vertex has a li...
AbstractAn L-list coloring of a graph G is a proper vertex coloring in which every vertex v receives...
AbstractPlanar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be...
AbstractIn this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-c...
AbstractIn this paper, we mainly prove that planar graphs without 4-, 7- and 9-cycles are 3-colorabl...
In 2018, Dvořák and Postle introduced DP-coloring and proved that planar graphs without cycles of le...
AbstractIn this article, we consider planar graphs in which each vertex is not incident to some cycl...
AbstractSteinberg asked whether every planar graph without 4 and 5 cycles is 3-colorable. Borodin, a...
AbstractIn this note, it is proved that every plane graph without 5- and 7-cycles and without adjace...
AbstractWe prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3≤i≤j...
AbstractPlanar graphs without cycles of length from 4 to 7 are proved to be 3-colorable. Moreover, i...
AbstractWe prove that every planar graph of girth at least 5 is 3-choosable. It is even possible to ...
Add to ORKG