arXiv Analytics

Sign in

arXiv:1506.04629 [math.CO]AbstractReferencesReviewsResources

The 3-colorability of planar graphs without cycles of length 4, 6 and 9

Yingli Kang, Ligang Jin, Yingqian Wang

Published 2015-06-15Version 1

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

Comments: 15 pages, 1 figure
Categories: math.CO
Subjects: 05C10, 05C15
Keywords: planar graphs
Related articles: Most relevant | Search more
arXiv:1802.05953 [math.CO] (Published 2018-02-16)
Weak Dynamic Coloring of Planar Graphs
arXiv:1306.5283 [math.CO] (Published 2013-06-22)
On choosability with separation of planar graphs with lists of different sizes
arXiv:1109.2976 [math.CO] (Published 2011-09-14)
Choosability of planar graphs of girth 5

Links

Toolbox