On Hamilton Circuits in Tree Graphs

Authors:
  • GKG. Kishi
    G. Kishi
  • YKY. Kajitani
    Y. Kajitani

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.

This publication has 2 references indexed in Scilit: