{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:48:11Z","timestamp":1787496491404,"version":"build-2736575974"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1007\/bf01202237","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T08:31:07Z","timestamp":1109320267000},"page":"65-72","source":"Crossref","is-referenced-by-count":19,"title":["Two remarks on circular arc graphs"],"prefix":"10.1007","volume":"13","author":[{"given":"Pavol","family":"Hell","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0020-0190(87)90007-X","volume":"26","author":"A. Apostolico","year":"1987","unstructured":"Apostolico, A., Hambrusch, S.E.: Finding maximum cliques on circular arc graphs. Information Processing Letters26, 209?215 (1987)","journal-title":"Information Processing Letters"},{"key":"CR2","unstructured":"Bhattacharya, B., Kaller, D.M.: AnO(m+nlogn) algorithm for the maximum clique problem in circular arc graphs. Simon Fraser University CSS\/LCCR TR 94-26"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Bhattacharya, B., Hell, P., Huang, J.: A linear algorithm for maximum cliques in proper circular arc graphs. SIAM J. on Discrete Math (in press)","DOI":"10.1137\/S0895480192242754"},{"key":"CR4","unstructured":"Eschen, E.M., Spinrad, J.:O(n 2) recognition and isomorphism algorithms for circular-arc graphs. Proc 4th Ann SODA, pp. 128?137"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Feder, T., Hell, P., Huang, J.: List homomorphisms and circular arc graphs, submitted to Combinatorica","DOI":"10.1007\/s004939970003"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientbare Graphen, Acta Math. Acad. Sci. Hungar.18, 25?66 (1967)","journal-title":"Acad. Sci. Hungar."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230040407","volume":"4","author":"F. Gavril","year":"1974","unstructured":"Gavril, F.: Algorithms on circular-arc graphs. Networks4, 357?369 (1974)","journal-title":"Networks"},{"key":"CR8","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, Academic Press, N.Y. (1980)"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1002\/jgt.3190200312","volume":"20","author":"P. Hell","year":"1995","unstructured":"Hell, P., Huang, J.: Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs. J. Graph Theory20, 361?374 (1995)","journal-title":"J. Graph Theory"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1137\/0214018","volume":"14","author":"W.L. Hsu","year":"1985","unstructured":"Hsu, W.L.: Maximum weight clique algorithms for ciruclar arc graphs and circle graphs. SIAM J. Comput.14, 224?231 (1985)","journal-title":"SIAM J. Comput."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/S0097539793260726","volume":"24","author":"W.L. Hsu","year":"1995","unstructured":"Hsu, W.L.:O(mn) algorithms for the recognition and isomorphism problems on circular-arc graphs. SIAM J. Comput.24, 411?439 (1995)","journal-title":"SIAM J. Comput."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0020-0190(89)90220-2","volume":"31","author":"W.K. Shih","year":"1989","unstructured":"Shih, W.K., Hsu, W.L.: AnO(nlogn+mloglogn) maximum weight clique algorithm for circular arc graphs. Information Processing Letters31, 129?134 (1989)","journal-title":"Information Processing Letters"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Spinrad, J.: Circular-arc graphs with clique cover number two. J. Combinatorial TheoryB 300?306 (1988)","DOI":"10.1016\/0095-8956(88)90038-X"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0041-1647(68)90016-6","volume":"2","author":"K.E. Stouffers","year":"1968","unstructured":"Stouffers, K.E.: Scheduling of traffic lights ? a new approach. Transportation Res.2, 199?234 (1968)","journal-title":"Transportation Res."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/S0012-365X(76)80011-8","volume":"16","author":"W.T. Trotter","year":"1976","unstructured":"Trotter, W.T., Moore, J.I.: Characterization problems for graphs, partially ordered sets, lattices, and families of sets. Discrete Math.16, 361?381 (1976)","journal-title":"Discrete Math."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"535","DOI":"10.2140\/pjm.1971.39.535","volume":"39-2","author":"A. Tucker","year":"1971","unstructured":"Tucker, A.: Matrix characterization of circular arc graphs. Pacific J. Math.39-2, 535?545 (1971)","journal-title":"Pacific J. Math."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/0129040","volume":"29","author":"A. Tucker","year":"1975","unstructured":"Tucker, A.: Colouring a family of circular arcs. SIAM J. Appl. Math.29, 493?502 (1975)","journal-title":"SIAM J. Appl. Math."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0209001","volume":"9","author":"A. Tucker","year":"1980","unstructured":"Tucker, A.: An efficient test for circular arc graphs. SIAM J. Comput.9, 1?24 (1980)","journal-title":"SIAM J. Comput."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202237.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01202237\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T13:01:48Z","timestamp":1556715708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01202237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["BF01202237"],"URL":"https:\/\/doi.org\/10.1007\/bf01202237","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}