Article ID Journal Published Year Pages File Type
4650294 Discrete Mathematics 2007 6 Pages PDF
Abstract

In this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-colorable.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On 3-colorable planar graphs without prescribed cycles
Authors
, ,