Hamiltonism, degree sum and neighborhood intersections (Q1175978)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hamiltonism, degree sum and neighborhood intersections |
scientific article; zbMATH DE number 13091
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamiltonism, degree sum and neighborhood intersections |
scientific article; zbMATH DE number 13091 |
Statements
Hamiltonism, degree sum and neighborhood intersections (English)
0 references
25 June 1992
0 references
A 2-connected graph of order \(n\) is Hamiltonian if, for any three pairwise nonadjacent vertices, the degree sum is at least \(n\) plus the cardinality of the intersection of the three neighborhoods.
0 references
Hamiltonism
0 references
degree sum
0 references
neighborhood intersections
0 references
0.91240704
0 references
0.9085387
0 references
0.90140086
0 references
0.9005529
0 references
