Longest cycles in regular 2-connected claw-free graphs (Q1343791): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Ming-Chu Li / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Yanpei Liu / rank | |||
Normal rank | |||
Revision as of 07:59, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Longest cycles in regular 2-connected claw-free graphs |
scientific article |
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
