Spanning trees of countable graphs omitting sets of dominated ends
type: Item
instance of: scholarly article
title: Spanning trees of countable graphs omitting sets of dominated ends
zbMATH Open document ID: 0935.05034
DOI: 10.1016/S0012-365X(98)00042-9
author: François Laviolette
author: Norbert Polat
published in: Discrete Mathematics
publication date: 1999-08-09T00:00:00Z
review text: The paper considers infinite graphs. For the set of rays of such graphs an equivalence relation is declared saying that two rays \(R\) and \(R'\) are equivalent if one cannot separate an infinite part of \(R\) from an infinite part of \(R'\) by the removal of finitely many vertices of the graph. The equivalence classes of this relation are called ends. The paper discusses the properties of this concept in view of spanning trees of countable graphs.
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1321844
zbMATH Keywords: infinite graphs
zbMATH Keywords: ends
zbMATH Keywords: spanning trees
reviewed by: Dietmar Cieslik
MaRDI profile type: Publication
cites work: Q3256687
cites work: The end structure of a graph: Recent results and open problems
cites work: Über die Enden diskreter Räume und Gruppen
cites work: Über unendliche Wege in Graphen
cites work: Q4881843
cites work: Q5620622
cites work: Aspects topologiques de la séparation dans les graphes infinis. I. II
cites work: Développements terminaux des graphes infinis I. Arbres maximaux coterminaux
cites work: Développements terminaux des graphes infinis II. Degré de développement terminal
cites work: Développments terminaux des graphes infinis III. Arbres maximaux sans rayon, cardinalité maximum des ensembles disjoints de rayons
cites work: Q3484856
cites work: Q4290239
cites work: An end-faithful spanning tree counterexample
cites work: End-faithful forests and spanning trees in infinite graphs
cites work: Infinite connected graphs with no end-preserving spanning trees
description: scientific article; zbMATH DE number 1321844