An extremal problem for a graphic sequence to have a realization containing every 2-tree with prescribed size (Q2816514)
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: An extremal problem for a graphic sequence to have a realization containing every 2-tree with prescribed size |
scientific article; zbMATH DE number 6618857
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An extremal problem for a graphic sequence to have a realization containing every 2-tree with prescribed size |
scientific article; zbMATH DE number 6618857 |
Statements
23 August 2016
0 references
degree sequences
0 references
graphic sequences
0 references
realization
0 references
2-trees
0 references
An extremal problem for a graphic sequence to have a realization containing every 2-tree with prescribed size (English)
0 references
