This article is cited in
3 papers
An upper bound on the chromatic number of circle graphs without $K_4$
G. V. Nenashev Saint-Petersburg State University, Saint-Petersburg, Russia
Abstract:
Let
$G$ be a circle graph without clique on 4 vertices. We proof that the chromatic number of
$G$ doesn't exceed 30.
Key words and phrases:
circle graph, proper coloring, chromatic number.
UDC:
519.174.7
Received: 20.09.2011
© , 2025
Fulltext:
PDF file (199 kB)