{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:56:59Z","timestamp":1725562619442},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221135"},{"type":"electronic","value":"9783540259602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25960-2_10","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T19:21:46Z","timestamp":1281295306000},"page":"132-138","source":"Crossref","is-referenced-by-count":1,"title":["Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Bessy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phan","family":"Thomass\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"Digraphs. Theory, algorithms and applications, Springer Monographs in Mathematics","author":"J. Bang-Jensen","year":"2001","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs. Theory, algorithms and applications, Springer Monographs in Mathematics. Springer, London (2001)"},{"key":"10_CR2","first-page":"59","volume":"17","author":"C. Berge","year":"1983","unstructured":"Berge, C.: Path partitions in directed graphs. Ann. Discrete Math.\u00a017, 59\u201363 (1983)","journal-title":"Ann. Discrete Math."},{"key":"10_CR3","volume-title":"Handbook of combinatorics","author":"J.A. Bondy","year":"1995","unstructured":"Bondy, J.A.: Basic graph theory: paths and circuits. In: Handbook of combinatorics, vol.\u00a01(2), Elsevier, Amsterdam (1995)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0012-365X(94)00173-1","volume":"146","author":"J.A. Bondy","year":"1995","unstructured":"Bondy, J.A.: A short proof of the Chen-Manalastas theorem. Discrete Maths.\u00a0146, 289\u2013292 (1995)","journal-title":"Discrete Maths."},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1112\/jlms\/s2-14.2.277","volume":"14","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A.: Diconnected orientations and a conjecture of Las Vergnas. J. London Math. Soc.\u00a014(2), 277\u2013282 (1976)","journal-title":"J. London Math. Soc."},{"key":"10_CR6","first-page":"2151","volume":"249","author":"P. Camion","year":"1959","unstructured":"Camion, P.: Chemins et circuits hamiltoniens des graphes complets. C. R. Acad. Sci.\u00a0249, 2151\u20132152 (1959)","journal-title":"C. R. Acad. Sci."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0012-365X(83)90188-7","volume":"44","author":"C.C. Chen","year":"1983","unstructured":"Chen, C.C., Manalastas, P.: Every finite strongly connected digraph of stability 2 has a Hamiltonian path. Discrete Mathematics\u00a044, 243\u2013250 (1983)","journal-title":"Discrete Mathematics"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Annals of Mathematics\u00a051, 161\u2013166 (1950)","journal-title":"Annals of Mathematics"},{"key":"10_CR9","unstructured":"Gallai, T.: Problem 15. In: Fiedler, M. (ed.) Theory of Graphs and its Applications, Czech, p. 161. Acad. Sci., Prague (1964)"},{"key":"10_CR10","first-page":"181","volume":"21","author":"T. Gallai","year":"1960","unstructured":"Gallai, T., Milgram, A.N.: Verallgemeinerung eines graphentheoretischen Satzes von R\u00e9dei. Acta Sci. Math. Szeged\u00a021, 181\u2013186 (1960)","journal-title":"Acta Sci. Math. Szeged"},{"key":"10_CR11","unstructured":"Thomass\u00e9, S.: Spanning a strong digraph by \u03b1 cycles, the case \u03b1 = 3 of Gallai\u2019s conjecture (preprint)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0012-365X(00)00217-X","volume":"229","author":"X. Zhu","year":"2001","unstructured":"Zhu, X.: Circular chromatic number: a survey. Discrete Mathematics\u00a0229, 371\u2013410 (2001)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25960-2_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:19:39Z","timestamp":1619997579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25960-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221135","9783540259602"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25960-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}