An Upper bound on the chromatic number of circle graphs without $K_4$
Combinatorics
2012-12-18 v1
Abstract
Let be a circle graph without clique on 4 vertices. We prove that the chromatic number of doesn't exceed 30.
Keywords
Cite
@article{arxiv.1212.3983,
title = {An Upper bound on the chromatic number of circle graphs without $K_4$},
author = {G. V. Nenashev},
journal= {arXiv preprint arXiv:1212.3983},
year = {2012}
}