{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T17:09:37Z","timestamp":1676826577545},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s00493-008-2197-0","type":"journal-article","created":{"date-parts":[[2008,4,26]],"date-time":"2008-04-26T11:55:19Z","timestamp":1209210919000},"page":"131-143","source":"Crossref","is-referenced-by-count":4,"title":["Cyclic orders: Equivalence and duality"],"prefix":"10.1007","volume":"28","author":[{"given":"Pierre","family":"Charbit","sequence":"first","affiliation":[]},{"given":"Andr\u00e1s","family":"Seb\u0151","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,4,27]]},"reference":[{"issue":"6","key":"2197_CR1","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1007\/s00493-007-2073-3","volume":"27","author":"S. Bessy","year":"2007","unstructured":"S. Bessy and S. Thomass\u00e9: Spanning a strong digraph by \u03b1 circuits: A proof of Gallai\u2019s conjecture; Combinatorica 27(6) (2007), 659\u2013667.","journal-title":"Combinatorica"},{"key":"2197_CR2","volume-title":"Circuits in Graphs and Digraphs via Embeddings","author":"P. Charbit","year":"2005","unstructured":"P. Charbit: Circuits in Graphs and Digraphs via Embeddings, PhD thesis, Universit\u00e9 Claude Bernard, Lyon, December 2005."},{"key":"2197_CR3","unstructured":"T. Gallai: Problem 15, in: Theory of Graphs and its Applications (M. Fiedler, ed.), Czech. Acad. Sci. Publ., 1964, p. 161."},{"key":"2197_CR4","unstructured":"A. Schrijver: Combinatorial Optimization, Springer, 2003."},{"issue":"4","key":"2197_CR5","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/j.jctb.2006.09.005","volume":"97","author":"A. Seb\u0151","year":"2007","unstructured":"A. Seb\u0151: Minmax Relations for Cyclically Ordered Digraphs, Journal of Combinatorial Theory, Ser. B 97(4) (2007), 518\u2013552.","journal-title":"Journal of Combinatorial Theory, Ser. B"},{"issue":"1\u20133","key":"2197_CR6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0012-365X(00)00217-X","volume":"229","author":"X. Zhu","year":"2001","unstructured":"X. Zhu: Circular chromatic number: a survey; Discrete Mathematics 229(1\u20133) (2001), 371\u2013410.","journal-title":"Discrete Mathematics"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2197-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-008-2197-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2197-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:45Z","timestamp":1559093565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-008-2197-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["2197"],"URL":"https:\/\/doi.org\/10.1007\/s00493-008-2197-0","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3]]}}}