trees) and circuits, co-trees (co-
trees) and cutsets of a graph are presented. They may be considered as a generalization and an extension of Hakimi and Green\´s technique of enumerating trees and
trees. Algebraic relationships for generating trees and co-trees by elementary transformations are also given.