arXiv Analytics

Sign in

arXiv:1212.3983 [math.CO]AbstractReferencesReviewsResources

An Upper bound on the chromatic number of circle graphs without $K_4$

G. V. Nenashev

Published 2012-12-17Version 1

Let $G$ be a circle graph without clique on 4 vertices. We prove that the chromatic number of $G$ doesn't exceed 30.

Journal: Journal of Mathematical Sciences, 2012, Volume 184, Issue 5, pp 629-633
Categories: math.CO
Subjects: 05C15, 05C10
Related articles: Most relevant | Search more
arXiv:1207.1882 [math.CO] (Published 2012-07-08, updated 2013-12-18)
Realizing the chromatic numbers and orders of spinal quadrangulations of surfaces
arXiv:1404.1698 [math.CO] (Published 2014-04-07, updated 2014-09-20)
The Sum and Product of Chromatic Numbers of Graphs and their Line Graphs
arXiv:math/0507110 [math.CO] (Published 2005-07-06, updated 2007-09-14)
The chromatic numbers of double coverings of a graph

Links

Toolbox