Infinite connected graphs with no end-preserving spanning trees
type: Item
instance of: scholarly article
title: Infinite connected graphs with no end-preserving spanning trees
zbMATH Open document ID: 0753.05030
DOI: 10.1016/0095-8956(92)90059-7
author: Carsten Thomassen
published in: Journal of Combinatorial Theory. Series B
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 64855
zbMATH Keywords: infinite connected graph
zbMATH Keywords: spanning tree
zbMATH Keywords: infinite connectivity
MaRDI profile type: Publication
full work available at URL: 0095-8956(92)90059-7
OpenAlex ID: W2022502417
cites work: Über unendliche Wege in Graphen
cites work: Aspects topologiques de la séparation dans les graphes infinis. I. II
cites work: Q3484856
cites work: Q3216670
Recommended article: Q4290239
Recommended article: On end-faithful spanning trees in infinite graphs
Recommended article: Infinite, highly connected digraphs with no two arc-disjoint spanning trees
Recommended article: On spanning trees and \(k\)-connectedness in infinite graphs
Recommended article: On the connectivity of infinite graphs
Recommended article: End-faithful forests and spanning trees in infinite graphs
Recommended article: Q3204497
Recommended article: Q4851798
Recommended article: Infinite paths in locally finite graphs and in their spanning trees
Recommended article: A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
description: scientific article; zbMATH DE number 64855