{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:08:09Z","timestamp":1725980889918},"reference-count":8,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6427,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1989,3]]},"abstract":"Abstract<\/jats:title>We present a construction of countably infinite, highly connected graphs and digraphs, which shows that several basic connectivity results on finite graphs, including Edmondsapos;s branching theorem, cannot be extended to the infinite case.<\/jats:p>","DOI":"10.1002\/jgt.3190130110","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T12:18:21Z","timestamp":1180181901000},"page":"71-74","source":"Crossref","is-referenced-by-count":15,"title":["Infinite, highly connected digraphs with no two arc\u2010disjoint spanning trees"],"prefix":"10.1002","volume":"13","author":[{"given":"Ron","family":"Aharoni","sequence":"first","affiliation":[]},{"given":"Carsten","family":"Thomassen","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","article-title":"Menger's theorem for countable graphs","author":"Aharoni R.","journal-title":"J. Combinat. Theory Ser. B"},{"key":"e_1_2_1_3_2","first-page":"91","volume-title":"Combinatorial Algorithms","author":"Edmonds J.","year":"1973"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579461"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02582931"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1960-049-6"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(79)90050-9"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190050403"},{"key":"e_1_2_1_9_2","volume-title":"Proceedings of the Third International Conference on Combinatorial Mathematics","author":"Thomassen C."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190130110","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T16:52:14Z","timestamp":1697907134000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["10.1002\/jgt.3190130110"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130110","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}