Ore's theorem (Q6481358)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: [[]] |
theorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycle
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ore's theorem |
theorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycle |
Statements
Identifiers
2777942178
0 references
