Spanning trees: A survey (Q659663)
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: Spanning trees: A survey |
scientific article; zbMATH DE number 5999810
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spanning trees: A survey |
scientific article; zbMATH DE number 5999810 |
Statements
Spanning trees: A survey (English)
0 references
24 January 2012
0 references
This survey does not contain any proofs, only definitions, statements of known results and related open problems, and 195 references. Considered types of spanning trees: with upper bounds on degrees, with upper bounds on the number of leaves or on the number of branch vertices, with small average distance, preserving degrees of as many vertices as possible, isomorphic to a particular tree (and some other, with more complicated descriptions).
0 references
Spanning tree
0 references
Hamiltonian cycle
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7943302392959595
0 references
0.7893632650375366
0 references
0.7879488468170166
0 references
0.7751509547233582
0 references
