{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:30:09Z","timestamp":1725535809735},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020285"},{"type":"electronic","value":"9783642020292"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02029-2_13","type":"book-chapter","created":{"date-parts":[[2009,7,27]],"date-time":"2009-07-27T10:12:39Z","timestamp":1248689559000},"page":"134-143","source":"Crossref","is-referenced-by-count":0,"title":["On Path Partitions and Colourings in Digraphs"],"prefix":"10.1007","author":[{"given":"Irith","family":"Ben-Arroyo Hartman","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"249","DOI":"10.2140\/pjm.1985.118.249","volume":"118","author":"R. Aharoni","year":"1985","unstructured":"Aharoni, R., Ben-Arroyo Hartman, I., Hoffman, A.J.: Path partitions and packs of acyclic digraphs. Pacific Journal of Mathematics\u00a0118(2), 249\u2013259 (1985)","journal-title":"Pacific Journal of Mathematics"},{"key":"13_CR2","volume-title":"Network Flows","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice Hall, Englewood Cliffs (1993)"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0195-6698(82)80022-X","volume":"3","author":"C. Berge","year":"1982","unstructured":"Berge, C.: k-optimal partitions of a directed graph. Europ. J. Combinatorics\u00a03, 97\u2013101 (1982)","journal-title":"Europ. J. Combinatorics"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.ejc.2006.10.003","volume":"29","author":"E. Berger","year":"2008","unstructured":"Berger, E., Hartman, I.B.-A.: Proof of Berge\u2019s Strong Path Partition Conjecture for k\u2009=\u20092. Europ. J. Combinatorics\u00a029(1), 179\u2013192 (2008)","journal-title":"Europ. J. Combinatorics"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0195-6698(86)80036-1","volume":"7","author":"K. Cameron","year":"1986","unstructured":"Cameron, K.: On k-optimum dipath partitions and partial k-colourings of acyclic digraphs. Europ. J. Combinatorics\u00a07, 115\u2013118 (1986)","journal-title":"Europ. J. Combinatorics"},{"key":"13_CR6","first-page":"7","volume-title":"Proceedings of the Third China-USA International Conference on Graph Theory, Combinatorics, Computing and Applications","author":"K. Cameron","year":"1994","unstructured":"Cameron, K.: Gallai-type min-max inequalities. In: Proceedings of the Third China-USA International Conference on Graph Theory, Combinatorics, Computing and Applications, pp. 7\u201316. World Scientific, Singapore (1994)"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"P. Dilworth","year":"1950","unstructured":"Dilworth, P.: A decomposition theorem for partially ordered sets. Ann. of Math.\u00a051(1), 161\u2013166 (1950)","journal-title":"Ann. of Math."},{"key":"13_CR8","unstructured":"Mercier, F.: Personal communication"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/0095-8956(80)90079-9","volume":"29","author":"A. Frank","year":"1980","unstructured":"Frank, A.: On chain and antichain families of a partially ordered set. J. Comb. Theory, Ser. B\u00a029, 176\u2013184 (1980)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"13_CR10","first-page":"115","volume-title":"Theory of Graphs","author":"T. Gallai","year":"1968","unstructured":"Gallai, T.: On directed paths and circuits. In: Erdos, P., Katona, G. (eds.) Theory of Graphs, pp. 115\u2013118. Academic Press, New York (1968)"},{"key":"13_CR11","first-page":"181","volume":"21","author":"T. Gallai","year":"1960","unstructured":"Gallai, T., Milgram, A.N.: Verallgemeinerung eines graphentheoretischen satzes von Redei. Acta Sc. Math.\u00a021, 181\u2013186 (1960)","journal-title":"Acta Sc. Math."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0097-3165(76)90078-9","volume":"20","author":"C. Greene","year":"1976","unstructured":"Greene, C.: Some partitions associated with a partially ordered set. J. Combinatorial Theory, Ser. A\u00a020, 69\u201379 (1976)","journal-title":"J. Combinatorial Theory, Ser. A"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0097-3165(76)90077-7","volume":"20","author":"C. Greene","year":"1976","unstructured":"Greene, C., Kleitman, D.J.: The structure of Sperner k-families. J. Combinatorial Theory, Ser. A\u00a020, 41\u201368 (1976)","journal-title":"J. Combinatorial Theory, Ser. A"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"2498","DOI":"10.1016\/j.disc.2005.12.039","volume":"306","author":"I.B.-A. Hartman","year":"2006","unstructured":"Hartman, I.B.-A.: Berge\u2019s conjecture on directed path partitions - a survey. Discrete Math.\u00a0306, 2498\u20132514 (2006)","journal-title":"Discrete Math."},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0097-3165(81)90029-7","volume":"30","author":"N. Linial","year":"1981","unstructured":"Linial, N.: Extending the Greene-Kleitman theorem to directed graphs. J. Combinatorial Theory, Ser. A\u00a030, 331\u2013334 (1981)","journal-title":"J. Combinatorial Theory, Ser. A"},{"key":"13_CR16","first-page":"127","volume":"1","author":"B. Roy","year":"1976","unstructured":"Roy, B.: Nombre chromatique et plus longs chemins, Rev. F1. Automat. Informat.\u00a01, 127\u2013132 (1976)","journal-title":"Automat. Informat."},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0001-8708(79)90010-0","volume":"33","author":"M. Saks","year":"1979","unstructured":"Saks, M.: A short proof of the k-saturated partitions. Adv. In Math.\u00a033, 207\u2013211 (1979)","journal-title":"Adv. In Math."}],"container-title":["Lecture Notes in Computer Science","Graph Theory, Computational Intelligence and Thought"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02029-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T02:33:58Z","timestamp":1552098838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02029-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020285","9783642020292"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02029-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}