Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
simple graphs
|
| gptkbp:concerns |
Hamiltonian graphs
|
| gptkbp:field |
graph theory
|
| gptkbp:generalizes |
gptkb:Dirac's_theorem
gptkb:Ore's_theorem |
| https://www.w3.org/2000/01/rdf-schema#label |
Chvátal's theorem
|
| gptkbp:namedAfter |
gptkb:Václav_Chvátal
|
| gptkbp:provides |
sufficient condition for a graph to be Hamiltonian
|
| gptkbp:publicationYear |
1972
|
| gptkbp:publishedIn |
gptkb:Journal_of_Combinatorial_Theory,_Series_B
|
| gptkbp:sentence |
If the degree sequence d_1 ≤ d_2 ≤ ... ≤ d_n of a simple graph with n ≥ 3 vertices satisfies for every k < n/2, d_k ≥ k or d_{n−k} ≥ n−k, then the graph is Hamiltonian.
|
| gptkbp:bfsParent |
gptkb:Václav_Chvátal
|
| gptkbp:bfsLayer |
6
|