Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
simple graphs
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Ore's theorem
|
| gptkbp:namedAfter |
gptkb:Øystein_Ore
|
| gptkbp:publicationYear |
1960
|
| gptkbp:publishedIn |
gptkb:Duke_Mathematical_Journal
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_cycle
gptkb:Dirac's_theorem |
| gptkbp:sentence |
If G is a simple graph with n ≥ 3 vertices, and for every pair of non-adjacent vertices u and v, deg(u) + deg(v) ≥ n, then G is Hamiltonian.
|
| gptkbp:usedIn |
sufficient conditions for Hamiltonicity
|
| gptkbp:bfsParent |
gptkb:Øystein_Ore
|
| gptkbp:bfsLayer |
4
|