Ends in spanning trees
type: Item
instance of: scholarly article
title: Ends in spanning trees
zbMATH Open document ID: 0770.05038
DOI: 10.1016/0012-365X(92)90455-O
author: Xingxing Yu
published in: Discrete Mathematics
publication date: 1993-01-16T00:00:00Z
review text: The author deals with infinite graphs. R. Halin defined an end \(E\) of an infinite graph \(G\) as a set of 1-way infinite paths in \(G\) such that vertices \(P\) and \(Q\) are in \(E\) iff for any subset \(R\) of the vertice set there is a finite path in \(G-R\) joining \(P\) and \(Q\). The author proves that if \(T\) is a locally finite spanning tree of a connected infinite graph \(G\) and \(E\) is an end of \(G\), then \(T\) has at least one 1-way infinite path in \(E\).
reviewed by: G.Merkel
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 89966
zbMATH Keywords: end
zbMATH Keywords: infinite graph
zbMATH Keywords: spanning tree
MaRDI profile type: Publication
cites work: Über unendliche Wege in Graphen
cites work: Q3041212
cites work: Spanning trees of locally finite graphs
full work available at URL: 0012-365x(92)90455-o
OpenAlex ID: W2042441666
Recommended article: End spaces and spanning trees
Recommended article: Ends in free minimal spanning forests
Recommended article: Spanning trees with large number of end vertices
Recommended article: Spanning trees with pairwise nonadjacent endvertices
Recommended article: Q4945509
Recommended article: End‐faithful spanning trees in graphs without normal spanning trees
Recommended article: Q3801573
Recommended article: Spanning \(k\)-ended trees of bipartite graphs
Recommended article: Spanning trees of extended graphs
Recommended article: An End-Faithful Spanning Tree Counterexample
description: scientific article; zbMATH DE number 89966