On the k-colouring of circle-graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 294 LNCS, Issue , 1988, Pages 61-72

  Unger, Walter ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; POLYNOMIAL APPROXIMATION;

CIRCLE GRAPHS; MAXIMUM CLIQUE; NP COMPLETE; POLYNOMIAL-TIME;

GRAPHIC METHODS;

EID: 85032183539     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0035832     Document Type: Conference Paper

References (14)

1. H. de Fraysseix. A characterization of circle graphs. Europ. J. Combinatorics, Vol 5, 223–238, 1984.
2. S. Even and A. Itai. Queues, stacks and graphs. Theory of Machines and Computations, 71–86, 1971.
3. F. Gavril. Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks 3, 261–273, 1975.
4. C.P. Gabor, W.-L. Hsu, and K.J. Supowit. Recognizing circle graphs in polynomial time. FOCS, 85.
5. M.R. Garey, D.S. Johnson, G.L. Miller, and Ch.H. Papadimitriou. The complexity of coloring circular arcs and cords. SIAM Alg. Disc. Meth., 1. No. 2.:216–227, 1980.
6. U.I. Gupta, D.T. Lee, and J.Y.T. Leung. Efficient algorithms for interval graphs and circular-arc graphs. Networks, 12:459–467, 1982.
7. J.Y.-T. Leung. Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs. Journal of Algorithms 5, 5:22–35, 1984.
8. Werner Rheinboldt, editor. Not So Perfect Graphs, pages 235–253.
9. R.C. Read, D. Rotem, and J. Urrutia. Orientation of circle graphs. Journal of Graph Theory, 6:325–341, 1982.
10. D. Rotyem and J. Urrutia. Finding maximum cliques in circle graphs. Networks, 11:269–278, 1981.
11. A. Tucker. An efficient test for circular-arc graphs. SIAM J. Comput. Vol. 9. No. 1., 1–24, 1980.
12. W. Unger. On the k-Colouring of Circle Graphs. Technical Report, Universität Paderborn, 1987.
13. W. Wessel and R. Pöschel. On circle graphs. Graphs, Hypergraphs and Applications, 207–210, 1985.
14. M. Yannakakis. Four pages are necessary and sufficient for planar graphs. ACM, 104–108, 1986.