Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs (Q477134)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6376154
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs |
scientific article; zbMATH DE number 6376154 |
Statements
Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs (English)
0 references
2 December 2014
0 references
spanning tree
0 references
degree sum
0 references
insertible vertex
0 references
segment insertion
0 references
0.8687593340873718
0 references
0.8658565878868103
0 references
0.8622750043869019
0 references
0.8569033741950989
0 references
