Hamiltonian paths and hamiltonian connectivity in graphs (Q1309475): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q175582 |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Ralph J. Faudree / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Neighbourhood unions and Hamiltonian properties in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonism, degree sum and neighborhood intersections / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamilton connected graphs / rank | |||
Normal rank |
Latest revision as of 12:02, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hamiltonian paths and hamiltonian connectivity in graphs |
scientific article |
Statements
Hamiltonian paths and hamiltonian connectivity in graphs (English)
0 references
5 September 1994
0 references
A degree and neighborhood type condition on independent triples of vertices of a graph \(G\) that implies \(G\) is hamiltonian-connected is given. In particular, the following is proved. If \(G\) is a 3-connected graph of order \(n\) such that \(d(u) + d(v) + d(w)-| N(u) \cap N(v) \cap N(w) | \geq n+1,\) then \(G\) is hamiltonian-connected. This generalizes the classical degree condition result of Ore as well as other later extensions of this result.
0 references
hamiltonian paths
0 references
hamiltonian connectivity
0 references
neighborhood condition
0 references
hamiltonian-connected
0 references
degree condition
0 references