Longest cycles in regular 2-connected claw-free graphs (Q1343791): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Q591118 / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Yanpei Liu / rank | |||
| Property / author | |||
| Property / author: Ming-Chu Li / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Yanpei Liu / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hamilton cycles in regular 2-connected graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3680861 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4030544 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hamiltonian cycles in 3‐connected claw‐free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Longest paths and cycles in K1,3-free graphs / rank | |||
Normal rank | |||
Latest revision as of 11:43, 23 May 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
