DocumentCode :
1163069
Title :
The Existence of a Hamilton Circuit in a Tree Graph
Author :
Kamae, Takahiko
Volume :
14
Issue :
3
fYear :
1967
fDate :
9/1/1967 12:00:00 AM
Firstpage :
279
Lastpage :
283
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 :
Graph theory; Hamilton circuit existence proof; Topological methods; Tree-generation procedures; Circuits; Communication switching; Contracts; Helium; IEL; Transfer functions; Tree graphs;
fLanguage :
English
Journal_Title :
Circuit Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9324
Type :
jour
DOI :
10.1109/TCT.1967.1082707
Filename :
1082707
Link To Document :
بازگشت