On spanning trees and k-connectedness in infinite graphs. Diestel, R. J. Comb. Theory, Ser. B, 56(2):263-277, 1992.
Link
Paper bibtex @article{journals/jct/Diestel92,
added-at = {2006-02-01T00:00:00.000+0100},
author = {Diestel, Reinhard},
biburl = {https://www.bibsonomy.org/bibtex/229e1be1f6a029f32b708642e02da11fd/dblp},
date = {2006-02-01},
description = {dblp},
ee = {http://dx.doi.org/10.1016/0095-8956(92)90022-P},
interhash = {e297f38c91e32e687eacdc05b7224b2f},
intrahash = {29e1be1f6a029f32b708642e02da11fd},
journal = {J. Comb. Theory, Ser. B},
keywords = {dblp},
number = 2,
pages = {263-277},
timestamp = {2006-02-01T00:00:00.000+0100},
title = {On spanning trees and k-connectedness in infinite graphs.},
url = {http://dblp.uni-trier.de/db/journals/jct/jctb56.html#Diestel92},
volume = 56,
year = 1992
}
Downloads: 0
{"_id":"BFqwQqGNJS2ommjBb","bibbaseid":"diestel-onspanningtreesandkconnectednessininfinitegraphs-1992","author_short":["Diestel, R."],"bibdata":{"bibtype":"article","type":"article","added-at":"2006-02-01T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Diestel"],"firstnames":["Reinhard"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/229e1be1f6a029f32b708642e02da11fd/dblp","date":"2006-02-01","description":"dblp","ee":"http://dx.doi.org/10.1016/0095-8956(92)90022-P","interhash":"e297f38c91e32e687eacdc05b7224b2f","intrahash":"29e1be1f6a029f32b708642e02da11fd","journal":"J. Comb. Theory, Ser. B","keywords":"dblp","number":"2","pages":"263-277","timestamp":"2006-02-01T00:00:00.000+0100","title":"On spanning trees and k-connectedness in infinite graphs.","url":"http://dblp.uni-trier.de/db/journals/jct/jctb56.html#Diestel92","volume":"56","year":"1992","bibtex":"@article{journals/jct/Diestel92,\n added-at = {2006-02-01T00:00:00.000+0100},\n author = {Diestel, Reinhard},\n biburl = {https://www.bibsonomy.org/bibtex/229e1be1f6a029f32b708642e02da11fd/dblp},\n date = {2006-02-01},\n description = {dblp},\n ee = {http://dx.doi.org/10.1016/0095-8956(92)90022-P},\n interhash = {e297f38c91e32e687eacdc05b7224b2f},\n intrahash = {29e1be1f6a029f32b708642e02da11fd},\n journal = {J. Comb. Theory, Ser. B},\n keywords = {dblp},\n number = 2,\n pages = {263-277},\n timestamp = {2006-02-01T00:00:00.000+0100},\n title = {On spanning trees and k-connectedness in infinite graphs.},\n url = {http://dblp.uni-trier.de/db/journals/jct/jctb56.html#Diestel92},\n volume = 56,\n year = 1992\n}\n\n","author_short":["Diestel, R."],"key":"journals/jct/Diestel92","id":"journals/jct/Diestel92","bibbaseid":"diestel-onspanningtreesandkconnectednessininfinitegraphs-1992","role":"author","urls":{"Link":"http://dx.doi.org/10.1016/0095-8956(92)90022-P","Paper":"http://dblp.uni-trier.de/db/journals/jct/jctb56.html#Diestel92"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Diestel?items=1000","dataSources":["nW7S7KRYub4s4QxQk"],"keywords":["dblp"],"search_terms":["spanning","trees","connectedness","infinite","graphs","diestel"],"title":"On spanning trees and k-connectedness in infinite graphs.","year":1992}