Enumeration of all trees of a graph

The nonsingular submatrices of the characteristic part of the fundamental cutset matrix relative to a tree uniquely correspond to the other trees of a graph G. Using this principle, a method of listing, without duplication, all trees of G is presented. For implementation of the method on a computer, a large memory is not required.