Journal of Combinatorial Theory, Vol. 6, Number 3, April 1969, pp. 311-312.
All rights reserved by Academic Press, New York and London
ABSTRACT
The following theorem answers a question raised by S. Lin.Theorem. Let G be a graph with n nodes P_0, P_1, P_2, ..., P_{n-1}
and 2n branches which can be partitioned into 2 sets of n branches, H_1 and H_2,
each of which forms a Hamiltonian cycle. Then G contains a third Hamiltonian cycle H_3.
