On a connection between the existence of k-trees and the toughness of a graph (Q1120590)
From MaRDI portal
!
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 4101238
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a connection between the existence of k-trees and the toughness of a graph |
scientific article; zbMATH DE number 4101238 |
Statements
On a connection between the existence of k-trees and the toughness of a graph (English)
0 references
1989
0 references
toughness
0 references
spanning tree
0 references
Hamiltonian path
0 references
0.8606938719749451
0 references
0.8488188982009888
0 references
0.8459861874580383
0 references
