Longest cycles in regular 2-connected claw-free graphs (Q1343791)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 719466
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Longest cycles in regular 2-connected claw-free graphs |
scientific article; zbMATH DE number 719466 |
Statements
Longest cycles in regular 2-connected claw-free graphs (English)
0 references
31 May 1995
0 references
The author shows that every 2-connected, \(k\)-regular, claw-free graph of order \(n\) contains a cycle of length at least \(\min\{4k- 2,n\}\) for \(n\geq 8\), and this result is best possible.
0 references
Hamiltonian cycle
0 references
claw-free graph
0 references
0.920429229736328
0 references
0.8985939621925354
0 references
