On Hamiltonian claw-free graphs (Q686468): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:58, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Hamiltonian claw-free graphs |
scientific article |
Statements
On Hamiltonian claw-free graphs (English)
0 references
19 May 1994
0 references
It is shown that every 3-connected claw-free graph of order at most \(5d- 10\) contains a Hamilton circuit, where \(d\) is the minimum degree of the graph. This result partially generalizes a result of the reviewer [J. Graph Theory 12, No. 2, 209-216 (1988; Zbl 0642.05037)] for 3-connected graphs.
0 references
claw-free graph
0 references
Hamilton circuit
0 references
