Characterizing forbidden clawless triples implying Hamiltonian graphs (Q1598843)
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: Characterizing forbidden clawless triples implying Hamiltonian graphs |
scientific article; zbMATH DE number 1746277
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterizing forbidden clawless triples implying Hamiltonian graphs |
scientific article; zbMATH DE number 1746277 |
Statements
Characterizing forbidden clawless triples implying Hamiltonian graphs (English)
0 references
28 May 2002
0 references
The authors characterize those forbidden triples of graphs, no one of which is a generalized claw, sufficient to imply that a 2-connected graph of sufficiently large order is Hamiltonian. In addition, the authors present some interesting open problems.
0 references
Hamiltonian graph
0 references
forbidden triples
0 references
0.94190824
0 references
0.9285226
0 references
0.92544335
0 references
0.92423713
0 references
0.9234771
0 references
0.91878223
0 references
0 references
0 references
0.91251814
0 references
