A simple proof of a theorem of Jung (Q918991)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple proof of a theorem of Jung |
scientific article |
Statements
A simple proof of a theorem of Jung (English)
0 references
1990
0 references
This note contains a simple proof of the following theorem of H. A. Jung: If G is a 1-tough graph on n vertices such that any two nonadjacent vertices have degree sum at least n-4, then G is Hamiltonian.
0 references
Hamiltonian graph
0 references
1-tough graph
0 references
