Abstract :
It is shown that, in a given graph, the set of trees not containing a given branch can be obtained from the set of trees containing the given branch without duplications. Based on this, a simple derivation of Mayeda and Seshu´s technique on generation of trees without duplications is given.
