Edge-ends in countable graphs

DOI10.1006/jctb.1996.1734zbMath0873.05038OpenAlexW2071534723MaRDI QIDQ1362094

François Laviolette, Geňa Hahn, Jozef Širáň

Publication date: 12 August 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0964fa7ab8ad9f2e5c977af26c3eefaea94edbdd

zbMATH Keywords

treeedge-endedge-end-faithful spanning trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items

Graph-theoretical versus topological ends of graphs., Duality of Ends, Decompositions of infinite graphs. II: Circuit decompositions, Locally finite graphs with ends: A topological approach. I: Basic theory

Cites Work

• Unnamed Item
• An end-faithful spanning tree counterexample
• End-faithful forests and spanning trees in infinite graphs
• Infinite connected graphs with no end-preserving spanning trees
• The end structure of a graph: Recent results and open problems
• Spanning trees of countable graphs omitting sets of dominated ends
• Über unendliche Wege in Graphen
• Développments terminaux des graphes infinis III. Arbres maximaux sans rayon, cardinalité maximum des ensembles disjoints de rayons