Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs (Q960979)
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: Toughness threshold for the existence of 2-walks in K₄-minor-free graphs |
scientific article; zbMATH DE number 5687600
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs |
scientific article; zbMATH DE number 5687600 |
Statements
Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs (English)
0 references
29 March 2010
0 references
toughness
0 references
2-walk
0 references
series-parallel graph
0 references
0.8512268662452698
0 references
0.7952004075050354
0 references
0.7942951917648315
0 references
0.785637378692627
0 references
