Applications of lattice theory to graph decomposition (Q911609): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 17:59, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Applications of lattice theory to graph decomposition |
scientific article |
Statements
Applications of lattice theory to graph decomposition (English)
0 references
1990
0 references
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.
0 references
graph decomposition
0 references
multitree lattice
0 references
geometric lattice
0 references
multitree class
0 references