@article{veanes1996on,
author = {Veanes, Margus and Barklund, Jonas},
title = {On the number of edges in cycletrees},
year = {1996},
month = {January},
abstract = {Given N vertices v1,…, vn, how many edges does it take to form a graph that contains a Hamiltonian cycle (v1, v2,…, vN, v1) and a basic binary spanning tree with some vertex vr as root? In this article the question is answered exactly. Moreover, it is shown that for any odd N there exists a natural cycletree with N vertices, a minimal number of edges and a minimal total path length.},
publisher = {Elsevier},
url = {http://approjects.co.za/?big=en-us/research/publication/on-the-number-of-edges-in-cycletrees/},
pages = {225-229},
journal = {Information Processing Letters},
volume = {57},
edition = {Information Processing Letters},
}