{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T18:01:46Z","timestamp":1722880906179},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2007,11,1]],"date-time":"2007-11-01T00:00:00Z","timestamp":1193875200000},"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":[[2007,11]]},"DOI":"10.1007\/s00493-007-2073-3","type":"journal-article","created":{"date-parts":[[2008,5,29]],"date-time":"2008-05-29T16:24:00Z","timestamp":1212078240000},"page":"659-667","source":"Crossref","is-referenced-by-count":12,"title":["Spanning a strong digraph by \u03b1 circuits: A proof of Gallai\u2019s conjecture"],"prefix":"10.1007","volume":"27","author":[{"given":"St\u00e9phane","family":"Bessy","sequence":"first","affiliation":[]},{"given":"St\u00e9phan","family":"Thomass\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,5,30]]},"reference":[{"key":"2073_CR1","volume-title":"Digraphs. Theory, algorithms and applications","author":"J. Bang-Jensen","year":"2001","unstructured":"J. Bang-Jensen and G. Gutin: Digraphs. Theory, algorithms and applications, Springer Monographs in Mathematics, Springer-Verlag, London, 2001."},{"key":"2073_CR2","first-page":"59","volume":"17","author":"C. Berge","year":"1983","unstructured":"C. Berge: Path partitions in directed graphs, Ann. Discrete Math. 17 (1983), 59\u201363.","journal-title":"Ann. Discrete Math."},{"key":"2073_CR3","series-title":"Handbook of Combinatorics","volume-title":"Basic graph theory: paths and circuits","author":"J. A. Bondy","year":"1995","unstructured":"J. A. Bondy: Basic graph theory: paths and circuits, Handbook of Combinatorics, Vol. 1, 2, Elsevier, Amsterdam, 1995."},{"key":"2073_CR4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0012-365X(94)00173-1","volume":"146","author":"J. A. Bondy","year":"1995","unstructured":"J. A. Bondy: A short proof of the Chen-Manalastas theorem, Discrete Maths 146 (1995), 289\u2013292.","journal-title":"Discrete Maths"},{"key":"2073_CR5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1112\/jlms\/s2-14.2.277","volume":"14","author":"J. A. Bondy","year":"1976","unstructured":"J. A. Bondy: Diconnected orientations and a conjecture of Las Vergnas, J. London Math. Soc. (2) 14 (1976), 277\u2013282.","journal-title":"J. London Math. Soc. (2)"},{"key":"2073_CR6","first-page":"2151","volume":"249","author":"P. Camion","year":"1959","unstructured":"P. Camion: Chemins et circuits hamiltoniens des graphes complets, C. R. Acad. Sci. 249 (1959), 2151\u20132152.","journal-title":"C. R. Acad. Sci."},{"key":"2073_CR7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0012-365X(83)90188-7","volume":"44","author":"C. C. Chen","year":"1983","unstructured":"C. C. Chen and P. Manalastas: Every finite strongly connected digraph of stability 2 has a Hamiltonian path, Discrete Mathematics 44 (1983), 243\u2013250.","journal-title":"Discrete Mathematics"},{"key":"2073_CR8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R. P. Dilworth","year":"1950","unstructured":"R. P. Dilworth: A decomposition theorem for partially ordered sets, Annals of Mathematics 51 (1950), 161\u2013166.","journal-title":"Annals of Mathematics"},{"key":"2073_CR9","first-page":"161","volume-title":"Theory of Graphs and its Applications (M. Fiedler, ed.)","author":"T. Gallai","year":"1964","unstructured":"T. Gallai: Problem 15, in Theory of Graphs and its Applications (M. Fiedler, ed.), Czech. Acad. Sci., Prague (1964), pp. 161."},{"key":"2073_CR10","first-page":"181","volume":"21","author":"T. Gallai","year":"1960","unstructured":"T. Gallai and A. N. Milgram: Verallgemeinerung eines graphentheoretischen Satzes von R\u00e9dei, Acta Sci. Math. Szeged 21 (1960), 181\u2013186.","journal-title":"Acta Sci. Math. Szeged"},{"key":"2073_CR11","unstructured":"S. Thomass\u00e9: Spanning a strong digraph by \u03b1 cycles, the case \u03b1 = 3 of Gallai\u2019s conjecture; preprint."},{"key":"2073_CR12","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 (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-007-2073-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-007-2073-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-007-2073-3","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-007-2073-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,11]]}},"alternative-id":["2073"],"URL":"https:\/\/doi.org\/10.1007\/s00493-007-2073-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11]]}}}