On a connection between the existence of k-trees and the toughness of a graph (Q1120590): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Tough graphs and Hamiltonian circuits. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hamiltonian results inK1,3-free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3932831 / rank | |||
Normal rank | |||
Revision as of 14:23, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a connection between the existence of k-trees and the toughness of a graph |
scientific article |
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
