A refinement of Halin's end-faithful spanning tree theorem (Q2640605): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Über unendliche Wege in Graphen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Wurzelbäume und Kantenorientierungen in Graphen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Wurzelbäume und unendliche Wege in Graphen / rank | |||
Normal rank | |||
Latest revision as of 14:33, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A refinement of Halin's end-faithful spanning tree theorem |
scientific article |
Statements
A refinement of Halin's end-faithful spanning tree theorem (English)
0 references
1989
0 references
A subgraph H of G is called end-faithful if each end of G contains a ray of H and any two rays in H which belong to the same end of G belong to the same end of H. The authors show that an end-faithful subgraph H of the connected countable graph G can be extended to an end-faithful spanning tree of G if (a) H is a union of countably many disjoint rays or (b) H is a tree.
0 references
infinite graphs
0 references
ends
0 references
end-faithful subgraph
0 references
end-faithful spanning tree
0 references
