Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite undirected graphs
|
| gptkbp:concerns |
Hamiltonian graphs
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Chvátal–Erdős theorem
|
| gptkbp:namedAfter |
gptkb:Paul_Erdős
gptkb:Václav_Chvátal |
| gptkbp:publicationYear |
1972
|
| gptkbp:publishedIn |
gptkb:Journal_of_Combinatorial_Theory,_Series_B
|
| gptkbp:relatedTo |
gptkb:Dirac's_theorem
gptkb:Ore's_theorem |
| gptkbp:state |
If the independence number of a graph is at most its connectivity, then the graph is Hamiltonian.
|
| gptkbp:bfsParent |
gptkb:Václav_Chvátal
|
| gptkbp:bfsLayer |
6
|