Name
Abstract | ||
|---|---|---|
We show that every connected graph has a spanning tree that displays all its topological ends. This proves a 1964 conjecture of Halin in corrected form, and settles a problem of Diestel from 1992. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s00493-018-3572-0 | Combinatorica |
Keywords | Field | DocType |
05C63,05B35 | Graph,Topology,Discrete mathematics,Combinatorics,Spanning tree,Connectivity,Halin graph,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
39.0 | 3.0 | 0209-9683 |
Citations | PageRank | References |
1 | 0.41 | 9 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johannes Carmesin | 1 | 29 | 7.08 |