{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:51:56Z","timestamp":1767340316530},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540188347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0035832","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:40:10Z","timestamp":1138203610000},"page":"61-72","source":"Crossref","is-referenced-by-count":23,"title":["On the k-colouring of circle-graphs"],"prefix":"10.1007","author":[{"given":"Walter","family":"Unger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0195-6698(84)80005-0","volume":"5","author":"H. Fraysseix de","year":"1984","unstructured":"H. de Fraysseix. A characterization of circle graphs. Europ. J. Combinatorics, Vol 5, 223\u2013238, 1984.","journal-title":"Europ. J. Combinatorics"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"S. Even and A. Itai. Queues, stacks and graphs. Theory of Machines and Computations, 71\u201386, 1971.","DOI":"10.1016\/B978-0-12-417750-5.50011-7"},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/net.3230030305","volume":"3","author":"F. Gavril","year":"1975","unstructured":"F. Gavril. Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks 3, 261\u2013273, 1975.","journal-title":"Networks"},{"key":"7_CR4","unstructured":"C.P. Gabor, W.-L. Hsu, and K.J. Supowit. Recognizing circle graphs in polynomial time. FOCS, 85."},{"issue":"2","key":"7_CR5","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M.R. Garey","year":"1980","unstructured":"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\u2013227, 1980.","journal-title":"SIAM Alg. Disc. Meth."},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230120410","volume":"12","author":"U.I. Gupta","year":"1982","unstructured":"U.I. Gupta, D.T. Lee, and J.Y.T. Leung. Efficient algorithms for interval graphs and circular-arc graphs. Networks, 12:459\u2013467, 1982.","journal-title":"Networks"},{"issue":"5","key":"7_CR7","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/0196-6774(84)90037-3","volume":"5","author":"J.Y.-T. Leung","year":"1984","unstructured":"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\u201335, 1984.","journal-title":"Journal of Algorithms"},{"key":"7_CR8","unstructured":"Werner Rheinboldt, editor. Not So Perfect Graphs, pages 235\u2013253."},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/jgt.3190060309","volume":"6","author":"R.C. Read","year":"1982","unstructured":"R.C. Read, D. Rotem, and J. Urrutia. Orientation of circle graphs. Journal of Graph Theory, 6:325\u2013341, 1982.","journal-title":"Journal of Graph Theory"},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/net.3230110305","volume":"11","author":"D. Rotyem","year":"1981","unstructured":"D. Rotyem and J. Urrutia. Finding maximum cliques in circle graphs. Networks, 11:269\u2013278, 1981.","journal-title":"Networks"},{"issue":"1","key":"7_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0209001","volume":"9","author":"A. Tucker","year":"1980","unstructured":"A. Tucker. An efficient test for circular-arc graphs. SIAM J. Comput. Vol. 9. No. 1., 1\u201324, 1980.","journal-title":"SIAM J. Comput."},{"key":"7_CR12","unstructured":"W. Unger. On the k-Colouring of Circle Graphs. Technical Report, Universit\u00e4t Paderborn, 1987."},{"key":"7_CR13","unstructured":"W. Wessel and R. P\u00f6schel. On circle graphs. Graphs, Hypergraphs and Applications, 207\u2013210, 1985."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"M. Yannakakis. Four pages are necessary and sufficient for planar graphs. ACM, 104\u2013108, 1986.","DOI":"10.1145\/12130.12141"}],"container-title":["Lecture Notes in Computer Science","STACS 88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035832.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:15:21Z","timestamp":1607552121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035832"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540188347"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0035832","relation":{},"subject":[]}}