Enumeration of 2-trees of a graph
A procedure for enumerating the 2-trees of the type tij, r of a graph is given. The amount of computation needed for its implementation is much less than in the other known methods for this purpose.
A procedure for enumerating the 2-trees of the type tij, r of a graph is given. The amount of computation needed for its implementation is much less than in the other known methods for this purpose.