Article ID Journal Published Year Pages File Type
4646821 Discrete Mathematics 2016 9 Pages PDF
Abstract

In this paper, we prove that planar graphs without cycles of length 4, 6, 9 are 3-colorable.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The 3-colorability of planar graphs without cycles of length 4, 6 and 9
Authors
, , ,