{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T12:25:55Z","timestamp":1768739155474,"version":"3.49.0"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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":[[1991,12]]},"DOI":"10.1007\/bf01275674","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T08:07:14Z","timestamp":1111651634000},"page":"393-395","source":"Crossref","is-referenced-by-count":40,"title":["Highly connected non-2-linked digraphs"],"prefix":"10.1007","volume":"11","author":[{"given":"Carsten","family":"Thomassen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"J. C. Bermond, andL. Lov\u00e1sz: Problem 3, in:Recent advances in graph theory, Proc. Coll. Prague, Academic Prague (1975), 541."},{"key":"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 ? a survey,J. Graph Theory 5 (1981), 1?43.","journal-title":"J. Graph Theory"},{"key":"CR3","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,Theoret. Comput. Sci. 10 (1980), 111?121.","journal-title":"Theoret. Comput. Sci."},{"key":"CR4","unstructured":"L. Lov\u00e1sz: Problem, in: Proc. 5th British Conf. 1975,Congressus Numerantium XV. Utilitas Math. Publ. (1976), 696."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0195-6698(80)80039-4","volume":"1","author":"C. Thomassen","year":"1980","unstructured":"C. Thomassen: 2-linked graphs,Europ. J. Combinatorics 1 (1980), 371?378.","journal-title":"Europ. J. Combinatorics"},{"key":"CR6","unstructured":"C. Thomassen: Connectivity in tournaments, in:Graph Theory and Combinatorics (B. Bollob\u00e1s, ed.). Academic Press (1984), 305?313."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"C. Thomassen: Configurations in graphs of large minimum degree, connectivity or chromatic number, in: Proc. 3rd Internat. Conf. on Combinatorial Mathematics, New York 1985,Ann. of the New York Acad. Sci. Vol.555 (1989), 402?412.","DOI":"10.1111\/j.1749-6632.1989.tb22479.x"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01275674.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01275674\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01275674","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:15:09Z","timestamp":1556648109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01275674"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["BF01275674"],"URL":"https:\/\/doi.org\/10.1007\/bf01275674","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}