{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:38:28Z","timestamp":1787510308788,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540529217","type":"print"},{"value":"9783540471776","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52921-7_59","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:47:47Z","timestamp":1330188467000},"page":"101-108","source":"Crossref","is-referenced-by-count":12,"title":["Local tournaments and proper circular arc graphs"],"prefix":"10.1007","author":[{"given":"Pavol","family":"Hell","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00f8rgen","family":"Bang-Jensen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0020-0190(87)90007-X","volume":"26","author":"A. Apostolico","year":"1987","unstructured":"A. Apostolico and S. E. Hambrusch, Finding maximum cliques on circular arc graphs, Information Processing Letters 26 (1987) 209\u2013215.","journal-title":"Information Processing Letters"},{"key":"11_CR2","unstructured":"J. Bang-Jensen, Locally semicomplete digraphs, J. Graph Theory, to appear."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0166-218X(85)90025-3","volume":"12","author":"M. A. Bonuccelli","year":"1985","unstructured":"M. A. Bonuccelli, Dominating sets and domatic number of circular arc graphs, Discrete Applied Math. 12 (1985) 203\u2013213.","journal-title":"Discrete Applied Math."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0020-0190(79)90011-5","volume":"8","author":"M. A. Bonuccelli","year":"1979","unstructured":"M. A. Bonuccelli and D. P. Bovet, Minimum disjoint path covering for circular arc graphs, Information Processing Letters 8 (1979) 159\u2013161.","journal-title":"Information Processing Letters"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press 1980.","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/0196-6774(88)90023-5","volume":"9","author":"M. C. Golumbic","year":"1988","unstructured":"M. C. Golumbic and P. L. Hammer, Stability in circular arc graphs, J. Algorithms 9 (1988), 314\u2013320.","journal-title":"J. Algorithms"},{"key":"11_CR7","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, J. Y.-T. Leung, Efficient algorithms for interval graphs and circular arc graphs, Networks 12 (1982) 459\u2013467.","journal-title":"Networks"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0196-6774(83)90011-1","volume":"4","author":"P. Hell","year":"1983","unstructured":"P. Hell and M. Rosenfeld, The complexity of finding generalized paths in tournaments, J. Algorithms 4 (1983) 303\u2013309.","journal-title":"J. Algorithms"},{"key":"11_CR9","unstructured":"J. Huang, A result on local tournaments, unpublished manuscript, 1989."},{"key":"11_CR10","unstructured":"D. Knuth, Art of Computer Programming, v.3, Sorting and Searching, Addison-Wesley, 1973."},{"key":"11_CR11","unstructured":"Y. Manoussakis, A linear algorithm for finding hamiltonian cycles in tournaments., Rapport de recherche 488, 1989, Laboratoire de Recherche en Informatique, Universite de Paris \u2014 Sud."},{"key":"11_CR12","unstructured":"F. S. Roberts, Indifference graphs, in Proof techniques in Graph Theory (F. Harary ed.), pp. 139\u2013146; Academic Press, 1969."},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/jgt.3190060307","volume":"6","author":"D. J. Skrien","year":"1982","unstructured":"D. J. Skrien, A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular arc graphs, and nested interval graphs, J. Graph Theory 6 (1982) 309\u2013316.","journal-title":"J. Graph Theory"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0012-365X(85)90052-4","volume":"55","author":"A. Teng","year":"1985","unstructured":"A. Teng and A. Tucker, An O(qn) algorithm to q-color a proper family of circular arcs, Discrete Math. 55 (1985) 233\u2013243.","journal-title":"Discrete Math."},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1137\/0129040","volume":"29","author":"A. Tucker","year":"1975","unstructured":"A. Tucker, Coloring a family of circular arcs, SIAM J. Appl. Math. 29 (1975) 493\u2013502.","journal-title":"SIAM J. Appl. Math."},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0012-365X(74)80027-0","volume":"7","author":"A. Tucker","year":"1974","unstructured":"A. Tucker, Structure theorems for some circular arc graphs, Discrete Math. 7 (1974) 167\u2013195.","journal-title":"Discrete Math."},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"535","DOI":"10.2140\/pjm.1971.39.535","volume":"39","author":"A. Tucker","year":"1971","unstructured":"A. Tucker, Matrix characterizations of circular arc graphs, Pacific J. Math. 39 (1971) 535\u2013545.","journal-title":"Pacific J. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52921-7_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:25:44Z","timestamp":1605630344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52921-7_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540529217","9783540471776"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-52921-7_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990]]}}}