End-Faithful Spanning Trees of Countable Graphs with Prescribed Sets of Rays

DOI10.1023/A:1013797519839zbMath1079.05508MaRDI QIDQ3366551

Norbert Polat

Publication date: 14 February 2006

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/30613

zbMATH Keywords

countable graphspanning treesend-faithful graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

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
• Ends and multi-endings. I
• Ends and multi-endings. II
• Über unendliche Wege in Graphen
• Über die Enden diskreter Räume und Gruppen
• Développements terminaux des graphes infinis I. Arbres maximaux coterminaux

This page was built for publication: End-Faithful Spanning Trees of Countable Graphs with Prescribed Sets of Rays