File:Ore theorem proof.svg
| Uploaded by | David Eppstein |
|---|---|
| Upload date | 2019-01-14T06:02:28Z |
| MIME type | image/svg+xml |
| Dimensions | 441 × 207 px |
| File size | 2.1 KB |
Summary
| Description |
English: In a graph with the Hamiltonian path v1...vn but no Hamiltonian cycle, at most one of the two edges v1vi and vi − 1vn (shown as blue dashed curves) can exist. For, if they both exist, then adding them to the path and removing the (red) edge vi − 1vi would produce a Hamiltonian cycle. |
| Date | |
| Source | Own work |
| Author | David Eppstein |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
 
|
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|