Statements (12)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:appliesTo |
simple graph
|
| gptkbp:defines |
The Chvátal closure of a graph is obtained by recursively adding edges between pairs of non-adjacent vertices whose degree sum is at least the number of vertices, until no more such pairs exist.
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Chvátal closure
|
| gptkbp:introducedIn |
1972
|
| gptkbp:namedAfter |
gptkb:Václav_Chvátal
|
| gptkbp:property |
A graph is Hamiltonian if and only if its Chvátal closure is Hamiltonian.
|
| gptkbp:relatedTo |
Hamiltonian graph
|
| gptkbp:usedIn |
gptkb:Chvátal's_theorem
|
| gptkbp:bfsParent |
gptkb:Václav_Chvátal
|
| gptkbp:bfsLayer |
6
|