On a connection between the existence of k-trees and the toughness of a graph (Q1120590): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01788671 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2009946412 / rank | |||
Normal rank | |||
Latest revision as of 11:04, 30 July 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
