On spanning trees and k-connectedness in infinite graphs. Diestel, R. J. Comb. Theory, Ser. B, 56(2):263-277, 1992.
On spanning trees and k-connectedness in infinite graphs. [link]Link  On spanning trees and k-connectedness in infinite graphs. [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