{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:13:45Z","timestamp":1725981225163},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,6,24]],"date-time":"2015-06-24T00:00:00Z","timestamp":1435104000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00493-015-3173-0","type":"journal-article","created":{"date-parts":[[2015,6,24]],"date-time":"2015-06-24T09:41:09Z","timestamp":1435138869000},"page":"601-621","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Orientations of infinite graphs with prescribed edge-connectivity"],"prefix":"10.1007","volume":"36","author":[{"given":"Carsten","family":"Thomassen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"3173_CR1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/jgt.3190130110","volume":"13","author":"R Aharoni","year":"1989","unstructured":"R. Aharoni and C. Thomassen: Infinite, highly connected digraphs with no twoarc-disjoint spanning trees, J. Graph Theory 13 (1989), 71\u201374.","journal-title":"J. Graph Theory"},{"key":"3173_CR2","doi-asserted-by":"crossref","first-page":"2573","DOI":"10.1016\/j.disc.2010.06.007","volume":"310","author":"J Bar\u00c1t","year":"2010","unstructured":"J. Bar\u00c1t and M. Kriesell: What is on his mind?, Discrete Mathematics 310 (2010), 2573\u20132583.","journal-title":"Discrete Mathematics"},{"key":"3173_CR3","volume-title":"The MacMillanPress Ltd","author":"J A. Bondy","year":"1976","unstructured":"J. A. Bondy and U. S. R. Murty: Graph Theory with Applications, The MacMillanPress Ltd. (1976)."},{"key":"3173_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R Diestel","year":"2010","unstructured":"R. Diestel: Graph Theory, Springer Verlag (1997) and 4th edition (2010)."},{"key":"3173_CR5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01349245","volume":"203","author":"G A. Dirac","year":"1973","unstructured":"G. A. Dirac and C. Thomassen: Graphs in which every finite path is contained ina circuit, Math. Ann. 203 (1973), 65\u201375.","journal-title":"Math. Ann."},{"key":"3173_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","volume":"69B","author":"J Edmonds","year":"1965","unstructured":"J. Edmonds: Minimum partition of a matroid into independent subsets, J. Res. Nat.Bur. Standards Sect. B 69B (1965), 67\u201372.","journal-title":"J. Res. Nat.Bur. Standards Sect. B"},{"key":"3173_CR7","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02993589","volume":"40","author":"R Halin","year":"1974","unstructured":"R. Halin: A note on Menger's theorem for infinite locally finite graphs, Abh. Math.Sem. Univ. Hamburg 40 (1974), 111\u2013114.","journal-title":"Abh. Math.Sem. Univ. Hamburg"},{"key":"3173_CR8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.jctb.2005.01.003","volume":"94","author":"F Laviolette","year":"2005","unstructured":"F. Laviolette: Decompositions of infinite Graphs: I\u2013bond-faithful decompositions, Journal of Combinatorial Theory, Series B 94 (2005), 259\u2013277.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3173_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01902503","volume":"28","author":"L Lov\u00c1sz","year":"1976","unstructured":"L. Lov\u00c1sz: On some connectivity properties of eulerian graphs, Acta Math. Acad.Sci. Hung. 28 (1976), 129\u2013138.","journal-title":"Acta Math. Acad.Sci. Hung."},{"key":"3173_CR10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70504-1","volume":"3","author":"W Mader","year":"1978","unstructured":"W. Mader: A reduction method for edge-connectivity in graphs, Ann. Discrete Math. 3 (1978), 145\u2013164.","journal-title":"Ann. Discrete Math."},{"key":"3173_CR11","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B Mohar","year":"2001","unstructured":"B. Mohar and C. Thomassen: Graphs on Surfaces, Johns Hopkins University Press(2001)."},{"key":"3173_CR12","doi-asserted-by":"crossref","first-page":"555","DOI":"10.4153\/CJM-1960-049-6","volume":"12","author":"C St","year":"1960","unstructured":"C. St. J. A. Nash-Williams: On orientations, connectivity and odd-vertex-pairingsin finite graphs, Canad. J. Math. 12 (1960), 555\u2013567.","journal-title":"Canad. J. Math."},{"key":"3173_CR13","first-page":"445","volume":"36","author":"C St","year":"1961","unstructured":"C. St. J. A. Nash-Williams: Edge-disjoint spanning trees of finite graphs, J. Lon-don Math. Soc. 36 (1961), 445\u2013450.","journal-title":"J. Lon-don Math. Soc."},{"key":"3173_CR14","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/S0021-9800(67)80077-2","volume":"3","author":"C St","year":"1967","unstructured":"C. St. J. A. Nash-Williams: Infinite graphs-a survey, J. Combin. Theory 3 (1967),286\u2013301.","journal-title":"J. Combin. Theory"},{"key":"3173_CR15","first-page":"149","volume-title":"New Directions in the Theory of Graphs (Proc. Third Ann Arbor Conf.,Univ. Michigan, Ann Arbor, MI, 1971)","author":"C St","year":"1973","unstructured":"C. St. J. A. Nash-Williams: Unexplored and semi-explored territories in graphtheory, in: New Directions in the Theory of Graphs (Proc. Third Ann Arbor Conf.,Univ. Michigan, Ann Arbor, MI, 1971), Academic Press, New York (1973), 149\u2013186."},{"key":"3173_CR16","doi-asserted-by":"crossref","first-page":"281","DOI":"10.2307\/2303897","volume":"46","author":"H E. Robbins","year":"1939","unstructured":"H. E. Robbins: Questions, discussions, and notes: a theorem on graphs, with anapplication to a problem of traffic control, Amer. Math. Monthly 46 (1939), 281\u2013283.","journal-title":"Amer. Math. Monthly"},{"key":"3173_CR17","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\u2013378.","journal-title":"Europ. J. Combinatorics"},{"key":"3173_CR18","first-page":"129","volume-title":"Further Selected Topics in Graph Theory","author":"C Thomassen","year":"1983","unstructured":"C. Thomassen: Infinite graphs, in: Further Selected Topics in Graph Theory (L.W. Beineke and R.J. Wilson, eds.), Academic Press, London (1983), 129\u2013160."},{"key":"3173_CR19","first-page":"402","volume":"555","author":"C Thomassen","year":"1989","unstructured":"C. Thomassen: Configurations in graphs of large minimum degree, connectivity, orchromatic number, in: Combinatorial Mathematics: Proceedings of the Third Interna-tional Conference, New York 1985, Ann. New York Acad. Sci., New York 555 (1989), 402\u2013412.","journal-title":"Combinatorial Mathematics: Proceedings of the Third Interna-tional Conference"},{"key":"3173_CR20","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/j.jctb.2011.09.003","volume":"102","author":"C Thomassen","year":"2012","unstructured":"C. Thomassen: The weak 3-ow conjecture and the weak circular ow conjecture,J. Combin. Theory Ser. B. 102 (2012), 521\u2013529.","journal-title":"J. Combin. Theory Ser. B."},{"key":"3173_CR21","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W T. Tutte","year":"1961","unstructured":"W. T. Tutte: On the problem of decomposing a graph into n connected factors, J.London Math. Soc. 36 (1961), 221\u2013230.","journal-title":"J.London Math. Soc."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3173-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-015-3173-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3173-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3173-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T19:11:15Z","timestamp":1691781075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-015-3173-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,24]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["3173"],"URL":"https:\/\/doi.org\/10.1007\/s00493-015-3173-0","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,24]]}}}