Abstract
It is shown that the set of multitree classes equipped with a partial order is a lattice called a multitree lattice. This multitree lattice in fact is a geometric lattice. Since there is a one-to-one correspondence between a multitree class and an element of the multitree lattice, the trees of a composite of subgraphs can be generated without duplications by the set union of the Cartesian products of the multitree classes of the subgraphs, which form a maximal independent set.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
