The Existence of a Hamilton Circuit in a Tree Graph
暂无分享,去创建一个
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.
[1] T. Kamae. The Existence and Generation of a Hamilton Circuit in a Tree Graph , 1966 .
[2] R. Cummins. Hamilton Circuits in Tree Graphs , 1966 .
[3] W. Mayeda,et al. Generation of Trees without Duplications , 1965 .
[4] C. Coates,et al. General Topological Formulas for Linear Network Functions , 1958 .