Name
Abstract | ||
|---|---|---|
The minimum leaf number of a connected non-hamiltonian graph G is the number of leaves of a spanning tree of G with the fewest leaves among all spanning trees of G. Based on this quantity, Wiener introduced leaf-stable and leaf-critical graphs, concepts which generalise hypotraceability and hypohamiltonicity. In this article, we present new methods to construct leaf-stable and leaf-critical graphs and study their properties. Furthermore, we improve several bounds related to these families of graphs. These extend previous results of Horton, Thomassen, and Wiener. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.disc.2020.111884 | Discrete Mathematics |
Keywords | DocType | Volume |
Spanning tree,Minimum leaf number,Leaf-stable,Leaf-critical | Journal | 343 |
Issue | ISSN | Citations |
7 | 0012-365X | 1 |
PageRank | References | Authors |
0.35 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kenta Ozeki | 1 | 138 | 36.31 |
| Gábor Wiener | 2 | 64 | 10.65 |
| Carol T. Zamfirescu | 3 | 38 | 15.25 |