A sufficient condition for pancyclic graphs (Q2721329)
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: A sufficient condition for pancyclic graphs |
scientific article; zbMATH DE number 1612951
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient condition for pancyclic graphs |
scientific article; zbMATH DE number 1612951 |
Statements
24 November 2002
0 references
Hamiltonian
0 references
claw-free graph
0 references
pancyclic
0 references
1.0000002
0 references
0.9916259
0 references
0.96280855
0 references
A sufficient condition for pancyclic graphs (English)
0 references
The author proves that, except for the 4-cycle and the 5-cycle, every 2-connected claw-free graph of diameter at most two is pancyclic.
0 references
