{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:55Z","timestamp":1759063495085},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9177,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1016\/0095-8956(88)90038-x","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"300-306","source":"Crossref","is-referenced-by-count":26,"title":["Circular-arc graphs with clique cover number two"],"prefix":"10.1016","volume":"44","author":[{"given":"Jeremy","family":"Spinrad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(88)90038-X_BIB1","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230040407","article-title":"Algorithms on circular-arc graphs","volume":"4","author":"Gavril","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0095-8956(88)90038-X_BIB2","author":"Columbic","year":"1980"},{"key":"10.1016\/0095-8956(88)90038-X_BIB3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1111\/j.2044-8317.1974.tb00534.x","article-title":"Some applications of graph theory and related non-metric techniques to problems of approximate seriation: the case of symmetric proximity measures","volume":"7","author":"Hubert","year":"1974","journal-title":"Brit. J. Math. Statist. Psych."},{"key":"10.1016\/0095-8956(88)90038-X_BIB4","first-page":"429","article-title":"Transitive orientation of graphs and identification of permutation graphs","volume":"12","author":"Pnueli","year":"1982","journal-title":"Networks"},{"key":"10.1016\/0095-8956(88)90038-X_BIB5","article-title":"Two Dimensional Partial Orders","author":"Spinrad","year":"1982"},{"issue":"Suppl. 1","key":"10.1016\/0095-8956(88)90038-X_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jcp.1040700403","article-title":"Circular genetic maps","volume":"70","author":"Stahl","year":"1967","journal-title":"J. Cell Physiol."},{"key":"10.1016\/0095-8956(88)90038-X_BIB7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0041-1647(68)90016-6","article-title":"Scheduling of traffic lights\u2014A new approach","volume":"2","author":"Stouffers","year":"1968","journal-title":"Transportation Res."},{"key":"10.1016\/0095-8956(88)90038-X_BIB8","series-title":"Lecture Notes in Computer Science 154, 10th Colloquium on Automata, Languages, and Programming","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1007\/BFb0036947","article-title":"Recognition and isomorphism of two dimensional partial orders","author":"Spinrad","year":"1983"},{"key":"10.1016\/0095-8956(88)90038-X_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0209001","article-title":"An efficient test for circular-arc graphs","volume":"9","author":"Tucker","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0095-8956(88)90038-X_BIB10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0012-365X(74)80027-0","article-title":"Structure theorems for some circular-arc graphs","volume":"7","author":"Tucker","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(88)90038-X_BIB11","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/S0012-365X(76)80011-8","article-title":"Characterization problems for graphs, partially ordered sets, lattices, and families of sets","volume":"16","author":"Trotter","year":"1976","journal-title":"Discrete Math."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589568890038X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589568890038X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T10:54:23Z","timestamp":1548759263000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009589568890038X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["009589568890038X"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(88)90038-x","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}