A linear algorithm for the hamiltonian completion number of a tree

Boesch, 1973-1974, On Covering The Points Of a Graph With Point Disjoint Paths, 201 Goodman, 1973-1974, On The Hamiltonian Completion Problem, 262 Harary, 1969 R.M. Karp, Reducibility Among Combinatorial Problems, in Complexity of Computer Computations (eds. R. Miller and J. Thatcher). S. Kundu and J. Misra, An Efficient Algorithm for Tree Partitioning, to appear in SIAM J. Computing. Knuth, 1969, Vol. 1 Misra, 1975, Optimal Chain Partitions of Trees, Inform. Proc. Letters, 4, 24, 10.1016/0020-0190(75)90057-5