The Existence of a Hamilton Circuit in a Tree Graph
- 1 September 1967
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 14 (3) , 279-283
- https://doi.org/10.1109/tct.1967.1082707
Abstract
The existence of a Hamilton circuit in a tree graph was first proved by Cummins.[1] However, his proof is hard to apply to the generation of all the trees in a given graph. A new proof is given in this paper; it is straightforward and concise, and also constructive and applicable to the tree generation. The outline of a tree generation procedure is shown.Keywords
This publication has 3 references indexed in Scilit:
- Hamilton Circuits in Tree GraphsIEEE Transactions on Circuit Theory, 1966
- Generation of Trees without DuplicationsIEEE Transactions on Circuit Theory, 1965
- General Topological Formulas for Linear Network FunctionsIRE Transactions on Circuit Theory, 1958