{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:31:19Z","timestamp":1709829079592},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"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":[[1987,3]]},"DOI":"10.1007\/bf02579210","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T21:14:06Z","timestamp":1174598046000},"page":"145-150","source":"Crossref","is-referenced-by-count":8,"title":["On digraphs with no two disjoint directed cycles"],"prefix":"10.1007","volume":"7","author":[{"given":"C.","family":"Thomassen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579210_CR1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0166-218X(85)90044-7","volume":"10","author":"E. Allender","year":"1985","unstructured":"E. Allender, On the number of cycles possible in digraphs with large girth,Discrete Appl. Math.,10 (1985), 211\u2013225.","journal-title":"Discrete Appl. Math."},{"key":"BF02579210_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190050102","volume":"5","author":"J.-C. Bermond","year":"1981","unstructured":"J.-C. Bermond andC. Thomassen, Cycles in digraphs\u2014a survey,J. Graph Theory,5 (1981), 1\u201343.","journal-title":"J. Graph Theory"},{"key":"BF02579210_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":"BF02579210_CR4","unstructured":"Z. \u00c9sik, On cycles of directed and undirected graphs,to appear."},{"key":"BF02579210_CR5","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 andJ. Wyllie, The directed subgraph homeomorphism problem,J. Theoret. Comput. Sci.,10 (1980), 111\u2013121.","journal-title":"J. Theoret. Comput. Sci."},{"key":"BF02579210_CR6","first-page":"362","volume-title":"Proc. Colloq. Tihany 1966","author":"T. Gallai","year":"1968","unstructured":"T. Gallai, Problem 6in: Theory of Graphs, Proc. Colloq. Tihany 1966, Academic Press, New York (1968), 362."},{"key":"BF02579210_CR7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/jgt.3190010412","volume":"1","author":"S. R. Kosaraju","year":"1977","unstructured":"S. R. Kosaraju, On independent circuits of a digraph.J. Graph Theory,1 (1977) 379\u2013382.","journal-title":"J. Graph Theory"},{"key":"BF02579210_CR8","first-page":"89","volume":"6","author":"A. V. Kostochka","year":"1983","unstructured":"A. V. Kostochka, A problem on directed graphs (in Russian with English summary),Acta Cybernet.,6 (1983), 89\u201391.","journal-title":"Acta Cybernet."},{"key":"BF02579210_CR9","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":"BF02579210_CR10","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"17","author":"C. L. Lucchesi","year":"1978","unstructured":"C. L. Lucchesi andD. H. Younger, A minimax theorem for directed graphs,J. Lond. Math. Soc.,17 (1978), 369\u2013374.","journal-title":"J. Lond. Math. Soc."},{"key":"BF02579210_CR11","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."},{"key":"BF02579210_CR12","unstructured":"C. Thomassen, Paths, circuits and subdivisions,in: Selected Topics in Graph Theory III (L. W. Beineke and R. J. Wilson eds.) Academic Press,to appear."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579210.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579210\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:44:59Z","timestamp":1558197899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,3]]}},"alternative-id":["BF02579210"],"URL":"https:\/\/doi.org\/10.1007\/bf02579210","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,3]]}}}