On Hamiltonian claw-free graphs (Q686468)
From MaRDI portal
!
WARNING
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 428315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Hamiltonian claw-free graphs |
scientific article; zbMATH DE number 428315 |
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
0 references
0 references
0.96968186
0 references
0.96755964
0 references
0.9664892
0 references
0 references
0.9629653
0 references
0.96092737
0 references
0.96053255
0 references
