An end-faithful spanning tree counterexample

DOI10.1016/0012-365X(91)90344-2zbMath0763.05032WikidataQ124994613 ScholiaQ124994613MaRDI QIDQ1191929

P. D. Seymour, Robin Thomas

Publication date: 27 September 1992

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

zbMATH Keywords

end-faithful spanning tree

Mathematics Subject Classification ID

Trees (05C05)

Related Items

Edge-ends in countable graphs ⋮ Duality theorems for stars and combs III: Undominated combs ⋮ End‐faithful spanning trees in graphs without normal spanning trees ⋮ End-faithful forests and spanning trees in infinite graphs ⋮ The end structure of a graph: Recent results and open problems ⋮ On spanning trees and \(k\)-connectedness in infinite graphs ⋮ Unnamed Item ⋮ End-Faithful Spanning Trees of Countable Graphs with Prescribed Sets of Rays ⋮ Spanning trees of countable graphs omitting sets of dominated ends

Cites Work

• Unnamed Item
• Unnamed Item
• Über unendliche Wege in Graphen
• Excluding Subdivisions of Infinite Cliques
• Excluding Infinite Trees
• Embedding Trees in the Rationals