Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs (Q3723710)
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: Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs |
scientific article; zbMATH DE number 3954286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs |
scientific article; zbMATH DE number 3954286 |
Statements
Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs (English)
0 references
1985
0 references
Polynomial time algorithms
0 references
strictly positive integer sequences
0 references
free tree
0 references
0.7853437662124634
0 references
0.7650072574615479
0 references
