C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard. The minimum size of graphs hamiltonian-connected from a vertex. Discrete Mathematics, 76(3):277-278, 1989. [doi]
@article{KnickerbockerLS89,
title = {The minimum size of graphs hamiltonian-connected from a vertex},
author = {C. J. Knickerbocker and Patti Frazer Lock and Michael Sheard},
year = {1989},
doi = {10.1016/0012-365X(89)90325-7},
url = {http://dx.doi.org/10.1016/0012-365X(89)90325-7},
tags = {graph-rewriting, C++, rewriting},
researchr = {https://researchr.org/publication/KnickerbockerLS89},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {76},
number = {3},
pages = {277-278},
}