{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T02:11:04Z","timestamp":1693966264937},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2007,11,1]],"date-time":"2007-11-01T00:00:00Z","timestamp":1193875200000},"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":[[2007,11]]},"DOI":"10.1007\/s00493-007-2188-6","type":"journal-article","created":{"date-parts":[[2008,5,29]],"date-time":"2008-05-29T16:24:00Z","timestamp":1212078240000},"page":"683-698","source":"Crossref","is-referenced-by-count":6,"title":["Connected but not path-connected subspaces of infinite graphs"],"prefix":"10.1007","volume":"27","author":[{"given":"Angelos","family":"Georgakopoulos","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,5,30]]},"reference":[{"key":"2188_CR1","doi-asserted-by":"crossref","unstructured":"M. A. Armstrong: Basic Topology, Springer-Verlag, 1983.","DOI":"10.1007\/978-1-4757-1793-8"},{"key":"2188_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.jctb.2004.03.005","volume":"92","author":"H. Bruhn","year":"2004","unstructured":"H. Bruhn: The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits, J. Combin. Theory (Series B) 92 (2004), 235\u2013256.","journal-title":"J. Combin. Theory (Series B)"},{"issue":"1\u20132","key":"2188_CR3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1017\/S0963548305007261","volume":"15","author":"H. Bruhn","year":"2006","unstructured":"H. Bruhn and R. Diestel: Duality in infinite graphs, Comb., Probab. Comput. 15(1\u20132) (2006), 75\u201390.","journal-title":"Comb., Probab. Comput."},{"key":"2188_CR4","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1002\/jgt.20101","volume":"50","author":"H. Bruhn","year":"2005","unstructured":"H. Bruhn, R. Diestel and M. Stein: Cycle-cocycle partitions and faithful cycle covers for locally finite graphs, J. Graph Theory 50 (2005), 150\u2013161.","journal-title":"J. Graph Theory"},{"issue":"2","key":"2188_CR5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.jctb.2005.07.005","volume":"96","author":"H. Bruhn","year":"2006","unstructured":"H. Bruhn and M. Stein: MacLane\u2019s planarity criterion for locally finite graphs, J. Combin. Theory (Series B) 96(2) (2006), 225\u2013239.","journal-title":"J. Combin. Theory (Series B)"},{"issue":"3","key":"2188_CR6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s00493-007-2149-0","volume":"27","author":"H. Bruhn","year":"2007","unstructured":"H. Bruhn and M. Stein: On end degrees and infinite circuits in locally finite graphs, Combinatorica 27(3) (2007), 269\u2013291.","journal-title":"Combinatorica"},{"key":"2188_CR7","unstructured":"H. Bruhn and X. Yu: Hamilton cycles in infinite planar graphs, see Chapter 6 of H. Bruhn, Infinite circuits in locally finite graphs, PhD thesis, Universit\u00e4t Hamburg, 2005."},{"key":"2188_CR8","first-page":"679","volume":"338","author":"D. I. Cartwright","year":"1993","unstructured":"D. I. Cartwright, P. M. Soardi and W. Woess: Martin and end compactifications for nonlocally finite graphs, Trans. Am. Math. Soc. 338 (1993), 679\u2013693.","journal-title":"Trans. Am. Math. Soc."},{"key":"2188_CR9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1017\/S0963548304006686","volume":"14","author":"R. Diestel","year":"2005","unstructured":"R. Diestel: The cycle space of an infinite graph, Comb., Probab. Comput. 14 (2005), 59\u201379.","journal-title":"Comb., Probab. Comput."},{"key":"2188_CR10","doi-asserted-by":"crossref","unstructured":"R. Diestel: Graph Theory, 3rd edition, Springer-Verlag, 2005. Electronic edition available at: http:\/\/www.math.uni-hamburg.de\/home\/diestel\/books\/graph.theory .","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"2188_CR11","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0095-8956(02)00034-5","volume":"87","author":"R. Diestel","year":"2003","unstructured":"R. Diestel and D. K\u00fchn: Graph-theoretical versus topological ends of graphs, J. Combin. Theory (Series B) 87 (2003), 197\u2013206.","journal-title":"J. Combin. Theory (Series B)"},{"issue":"1","key":"2188_CR12","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/s00493-004-0005-z","volume":"24","author":"R. Diestel","year":"2004","unstructured":"R. Diestel and D. K\u00fchn: On infinite cycles I, Combinatorica 24(1) (2004), 68\u201389.","journal-title":"Combinatorica"},{"issue":"1","key":"2188_CR13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00493-004-0005-z","volume":"24","author":"R. Diestel","year":"2004","unstructured":"R. Diestel and D. K\u00fchn: On infinite cycles II, Combinatorica 24(1) (2004), 91\u2013116.","journal-title":"Combinatorica"},{"issue":"6","key":"2188_CR14","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1016\/j.ejc.2003.01.002","volume":"25","author":"R. Diestel","year":"2004","unstructured":"R. Diestel and D. K\u00fchn: Topological paths, cycles and spanning trees in infinite graphs; Europ. J. Combin. 25(6) (2004), 835\u2013862.","journal-title":"Europ. J. Combin."},{"key":"2188_CR15","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1007\/BF01174375","volume":"33","author":"H. Freudenthal","year":"1931","unstructured":"H. Freudenthal: \u00dcber die Enden topologischer R\u00e4ume und Gruppen, Math. Zeitschr. 33 (1931), 692\u2013713.","journal-title":"Math. Zeitschr."},{"key":"2188_CR16","volume-title":"Elementary Topology","author":"D. W. Hall","year":"1955","unstructured":"D. W. Hall and G. L. Spencer: Elementary Topology, John Wiley, New York, 1955."},{"key":"2188_CR17","unstructured":"D. K\u00f6nig: Theorie der endlichen und unendlichen Graphen, Akademische Verlagsgesellschaft, 1936."},{"key":"2188_CR18","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jctb.1996.0035","volume":"67","author":"N. Polat","year":"1996","unstructured":"N. Polat: Ends and multi-endings I, J. Combin. Theory (Series B) 67 (1996), 86\u2013110.","journal-title":"J. Combin. Theory (Series B)"},{"issue":"2","key":"2188_CR19","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.jctb.2005.08.003","volume":"96","author":"M. Stein","year":"2006","unstructured":"M. Stein: Arboricity and tree-packing in locally finite graphs, J. Combin. Theory (Series B) 96(2) (2006), 302\u2013312.","journal-title":"J. Combin. Theory (Series B)"},{"issue":"4","key":"2188_CR20","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/jgt.20216","volume":"54","author":"M. Stein","year":"2007","unstructured":"M. Stein: Forcing highly connected subgraphs, J. Graph Theory 54(4) (2007), 331\u2013349.","journal-title":"J. Graph Theory"},{"key":"2188_CR21","unstructured":"W. Woess: Random walks on infinite graphs and groups, Cambridge University Press, 2002."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-007-2188-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-007-2188-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-007-2188-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:45Z","timestamp":1559093565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-007-2188-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,11]]}},"alternative-id":["2188"],"URL":"https:\/\/doi.org\/10.1007\/s00493-007-2188-6","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11]]}}}