Edge-ends in countable graphs

DOI10.1006/JCTB.1996.1734zbMATH Open0873.05038OpenAlexW2071534723MaRDI QIDQ1362094FDOQ1362094

Authors: Geňa Hahn, François Laviolette, 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

Recommendations

• End-Faithful Spanning Trees of Countable Graphs with Prescribed Sets of Rays
• A refinement of Halin's end-faithful spanning tree theorem
• scientific article; zbMATH DE number 887763
• End-faithful forests and spanning trees in infinite graphs

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)

Cites Work

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

Cited In (6)

• Decompositions of infinite graphs. II: Circuit decompositions
• Locally finite graphs with ends: A topological approach. I: Basic theory
• Graph-theoretical versus topological ends of graphs.
• Duality of ends
• Countably determined ends and graphs
• End-Faithful Spanning Trees of Countable Graphs with Prescribed Sets of Rays

This page was built for publication: Edge-ends in countable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362094)