On Hamilton Circuits in Tree Graphs
Authors:
- G. KishiGKG. Kishi
- Y. KajitaniYKY. Kajitani
- 1 March 1968
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 15 (1) , 42-50
Abstract
Some topological features of a tree graph are investigated. The results provide the decomposition of a tree graph into complete subgraphs. As an immediate consequence of the decomposition, two procedures for generating a Hamilton circuit in a tree graph are presented.Keywords
This publication has 2 references indexed in Scilit:
- Hamilton circuits in directed-tree graphsIEEE Transactions on Circuit Theory, 1967
- Hamilton Circuits in Tree GraphsIEEE Transactions on Circuit Theory, 1966