|
|
|
|
References
|
|
| |
| 1. |
F. Gavril, “Algorithms for a maximum clique and a maximum independent set of a circle graph”, Networks, 3 (1975), 261–273   |
| 2. |
H. de Fraysseix, “A characterization of circle graphs”, Europ. J. Combin., 5 (1984), 223–238  |
| 3. |
A. V. Kostochka, J. Kratochvil, “Covering and coloring poligon-circle graphs”, Disc. Math., 163 (1997), 299–305  |
| 4. |
A. V. Kostochka, “On upper bounds for the chromatic numbers of graphs”, Trudy Inst. Math., 10, 1988, 204–226 |
| 5. |
A. A. Ageev, “A triangle-free circle graph with chromatic number 5”, Discrete Mathematics, 152:1–3 (1996), 295–298 |
| 6. |
G. V. Nenashev, “Otsenka khromaticheskogo chisla grafa peresecheniya khord na okruzhnosti bez $K_4$”, Zap. nauchn. semin. POMI, 391, 2012, 149–156  |
| 7. |
V. A. Emelichev, O. I. Melnikov, V. I. Sarvanov, R. I. Tyshkevich, Lektsii po teorii grafov, Nauka, 1990 |
