Spanning trees with many leaves in cubic graphs
- 1 December 1989
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 13 (6) , 669-695
- https://doi.org/10.1002/jgt.3190130604
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Lower bounds on the independence number in terms of the degreesJournal of Combinatorial Theory, Series B, 1983
- Constructing full spanning trees for cubic graphsInformation Processing Letters, 1981