Generation of trees of a graph with the use of decomposition (Q800368)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generation of trees of a graph with the use of decomposition |
scientific article; zbMATH DE number 3875305
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generation of trees of a graph with the use of decomposition |
scientific article; zbMATH DE number 3875305 |
Statements
Generation of trees of a graph with the use of decomposition (English)
0 references
1984
0 references
The paper presents a method for the generation of trees of a graph by decomposition. Necessary and sufficient conditions that a graph decomposition must satisfy to avoid duplications in the generated set of trees are given. A criterion for the existence of such a decomposition is formulated and an appropriate algorithm for the graph decomposition is suggested.
0 references
tree generation
0 references
graph decomposition
0 references
0 references
0 references
0.9211453
0 references
0.91510934
0 references
0 references
0.90061575
0 references
0.8991151
0 references
0.8922532
0 references
