End-faithful forests and spanning trees in infinite graphs

DOI10.1016/0012-365X(91)90345-3zbMath0763.05034MaRDI QIDQ1191930

Jozef Širáň

Publication date: 27 September 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

spanning treeinfinite graphend-faithful forest

Mathematics Subject Classification ID

Trees (05C05)

Related Items (7)

Edge-ends in countable graphs ⋮ Duality theorems for stars and combs III: Undominated combs ⋮ The end structure of a graph: Recent results and open problems ⋮ Decompositions of infinite graphs. II: Circuit decompositions ⋮ End-Faithful Spanning Trees of Countable Graphs with Prescribed Sets of Rays ⋮ Multi-Faithful Spanning Trees of Infinite Graphs ⋮ Spanning trees of countable graphs omitting sets of dominated ends

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An end-faithful spanning tree counterexample
• Über unendliche Wege in Graphen
• A refinement of Halin's end-faithful spanning tree theorem
• On end-faithful spanning trees in infinite graphs
• Développments terminaux des graphes infinis III. Arbres maximaux sans rayon, cardinalité maximum des ensembles disjoints de rayons
• Wurzelbäume und unendliche Wege in Graphen

This page was built for publication: End-faithful forests and spanning trees in infinite graphs