A Fan-type condition for claw-free graphs to be Hamiltonian (Q1567673)
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 1462328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Fan-type condition for claw-free graphs to be Hamiltonian |
scientific article; zbMATH DE number 1462328 |
Statements
A Fan-type condition for claw-free graphs to be Hamiltonian (English)
0 references
3 December 2000
0 references
R. J. Gould proved that every 2-connected claw-free graph of diameter at most \(2\) is Hamiltonian. Considering a 2-connected claw-free graph \(G\) of order \(n\) (and of diameter at least \(3\)), the author proves that, if for each pair \(u\), \(v\) of vertices, \(\text{dist}(u, v)=3\) implies \(\max\{d(u), d(v)\}\geq {n- 4\over 2}\), then \(G\) is Hamiltonian.
0 references
claw-free graph
0 references
Hamiltonian
0 references
0.8538861274719238
0 references
0.8509398698806763
0 references
0.8299069404602051
0 references
