AbstractWe prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3≤i≤j≤7 is 3-colorable and pose some related problems on the 3-colorability of planar graphs
AbstractA graph G is k-choosable if every vertex of G can be properly colored whenever every vertex ...
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...
AbstractWe prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3≤i≤j...
AbstractIn this paper, we mainly prove that planar graphs without 4-, 7- and 9-cycles are 3-colorabl...
AbstractIn this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-c...
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
AbstractPlanar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be...
AbstractPlanar graphs without cycles of length from 4 to 7 are proved to be 3-colorable. Moreover, i...
AbstractIn this note, it is proved that every plane graph without 5- and 7-cycles and without adjace...
AbstractSteinberg's question from 1975 whether every planar graph without 4- and 5-cycles is 3-color...
AbstractIn this paper, we mainly prove that planar graphs without 4-, 7- and 9-cycles are 3-colorabl...
Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize...
AbstractIn this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-c...
AbstractA graph G is k-choosable if every vertex of G can be properly colored whenever every vertex ...
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...
AbstractWe prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3≤i≤j...
AbstractIn this paper, we mainly prove that planar graphs without 4-, 7- and 9-cycles are 3-colorabl...
AbstractIn this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-c...
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
AbstractPlanar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be...
AbstractPlanar graphs without cycles of length from 4 to 7 are proved to be 3-colorable. Moreover, i...
AbstractIn this note, it is proved that every plane graph without 5- and 7-cycles and without adjace...
AbstractSteinberg's question from 1975 whether every planar graph without 4- and 5-cycles is 3-color...
AbstractIn this paper, we mainly prove that planar graphs without 4-, 7- and 9-cycles are 3-colorabl...
Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize...
AbstractIn this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-c...
AbstractA graph G is k-choosable if every vertex of G can be properly colored whenever every vertex ...
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...
DOI
Add to ORKG