Back to Search
Start Over
An upper bound on the chromatic number of a circle graph without [K.sub.4]
- Source :
- Journal of Mathematical Sciences. August 1, 2012, Vol. 184 Issue 5, p629, 5 p.
- Publication Year :
- 2012
-
Abstract
- Let G be a circle graph without clique on 4 vertices. We prove that the chromatic number of G does not exceed 30. Bibliography: 7 titles.<br />UDC 519.174.7 1. INTRODUCTION Definition 1. Fix a circle. Let π he a finite set of chords of this circle. A circle graph G(A) is a graph with π as [...]
- Subjects :
- Mathematics
Subjects
Details
- Language :
- English
- ISSN :
- 10723374
- Volume :
- 184
- Issue :
- 5
- Database :
- Gale General OneFile
- Journal :
- Journal of Mathematical Sciences
- Publication Type :
- Academic Journal
- Accession number :
- edsgcl.380592535