Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs (Q878613)
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: Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs |
scientific article; zbMATH DE number 5146822
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs |
scientific article; zbMATH DE number 5146822 |
Statements
Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs (English)
0 references
26 April 2007
0 references
longest path
0 references
detour
0 references
Hamiltonian path
0 references
