Constructing full spanning trees for cubic graphs
- 1 October 1981
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 13 (1) , 8-11
- https://doi.org/10.1016/0020-0190(81)90141-1
Abstract
No abstract availableKeywords
This publication has 0 references indexed in Scilit: