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 simple proof of Grünbaum's theorem on the 3-colourability of planar graphs having at most ...
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
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...
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 note, it is proved that every plane graph without 5- and 7-cycles and without adjace...
AbstractIn this note, it is proved that every plane graph without 5- and 7-cycles and without adjace...
AbstractIn 1970, Havel asked if each planar graph with the minimum distance, d∇, between triangles l...
AbstractSteinberg asked whether every planar graph without 4 and 5 cycles is 3-colorable. Borodin, a...
AbstractPlanar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be...
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...
AbstractIn this article, we consider planar graphs in which each vertex is not incident to some cycl...
AbstractA simple proof of Grünbaum's theorem on the 3-colourability of planar graphs having at most ...
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
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...
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 note, it is proved that every plane graph without 5- and 7-cycles and without adjace...
AbstractIn this note, it is proved that every plane graph without 5- and 7-cycles and without adjace...
AbstractIn 1970, Havel asked if each planar graph with the minimum distance, d∇, between triangles l...
AbstractSteinberg asked whether every planar graph without 4 and 5 cycles is 3-colorable. Borodin, a...
AbstractPlanar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be...
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...
AbstractIn this article, we consider planar graphs in which each vertex is not incident to some cycl...
AbstractA simple proof of Grünbaum's theorem on the 3-colourability of planar graphs having at most ...
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
DOI
Add to ORKG