{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:19Z","timestamp":1759638259669},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"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":[[2011,12]]},"DOI":"10.1007\/s00493-011-2670-z","type":"journal-article","created":{"date-parts":[[2011,12,27]],"date-time":"2011-12-27T21:18:27Z","timestamp":1325020707000},"page":"639-668","source":"Crossref","is-referenced-by-count":9,"title":["On the problem of finding disjoint cycles and dicycles in a digraph"],"prefix":"10.1007","volume":"31","author":[{"given":"J\u00f8rgen","family":"Bang-Jensen","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Kriesell","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,28]]},"reference":[{"key":"2670_CR1","unstructured":"J. Bang-Jensen and G. Gutin: Digraphs. Theory, algorithms and applications, Second edition, Springer Monographs in Mathematics, Springer-Verlag London, Ltd., London (2009)."},{"key":"2670_CR2","doi-asserted-by":"crossref","first-page":"5138","DOI":"10.1016\/j.tcs.2009.08.034","volume":"46\u201349","author":"J. Bang-Jensen","year":"2009","unstructured":"J. Bang-Jensen and M. Kriesell: Disjoint directed and undirected paths and cycles in digraphs, Theoret. Comput. Sci. 46\u201349 (2009), 5138\u20135144.","journal-title":"Theoret. Comput. Sci"},{"key":"2670_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.4153\/CMB-1963-019-5","volume":"6","author":"G. A. Dirac","year":"1963","unstructured":"G. A. Dirac: Some results concerning the structure of graphs, Canad. Math. Bull. 6 (1963), 183\u2013210.","journal-title":"Canad. Math. Bull"},{"key":"2670_CR4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"S. Fortune, J. Hopcroft and J. Wyllie: The directed subgraph homeomorphism problem, Theoret. Comput. Sci. 10 (1980), 111\u2013121.","journal-title":"Theoret. Comput. Sci."},{"key":"2670_CR5","first-page":"289","volume":"16","author":"L. Lov\u00e1sz","year":"1965","unstructured":"L. Lov\u00e1sz: On graphs not containing independent circuits (in Hungarian), Mat. Lapok 16 (1965), 289\u2013299.","journal-title":"Mat. Lapok"},{"key":"2670_CR6","first-page":"203","volume-title":"Contemp. Math.","author":"W. McCuaig","year":"1993","unstructured":"W. McCuaig: Intercyclic digraphs, Graph structure theory (Seattle, WA, 1991), Contemp. Math. 147, Amer. Math. Soc., Providence, RI (1993), 203\u2013245."},{"key":"2670_CR7","unstructured":"A. Metzlar: Minimum transversal of cycles in intercyclic digraphs, PhD thesis, University of Waterloo, Ontario, Canada (1989)."},{"key":"2670_CR8","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1006\/jctb.1993.1018","volume":"57","author":"A. Metzlar","year":"1993","unstructured":"A. Metzlar: Disjoint paths in acyclic digraphs, J. Combin. Theory B 57 (1993), 228\u2013238.","journal-title":"J. Combin. Theory B"},{"key":"2670_CR9","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF02579195","volume":"3","author":"C. Thomassen","year":"1983","unstructured":"C. Thomassen: Disjoint cycles in digraphs, Combinatorica 3 (1983), 393\u2013396.","journal-title":"Combinatorica"},{"key":"2670_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0012-365X(85)80022-4","volume":"55","author":"C. Thomassen","year":"1985","unstructured":"C. Thomassen: The 2-linkage problem for acyclic digraphs, Discrete Math. 55 (1985), 73\u201387.","journal-title":"Discrete Math"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-011-2670-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-011-2670-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-011-2670-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:48Z","timestamp":1559079168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-011-2670-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["2670"],"URL":"https:\/\/doi.org\/10.1007\/s00493-011-2670-z","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}