Size of this PNG preview of this SVG file: 665 × 328 pixels. Other resolutions: 320 × 158 pixels | 640 × 316 pixels | 1,024 × 505 pixels | 1,280 × 631 pixels | 2,560 × 1,263 pixels.
Original file (SVG file, nominally 665 × 328 pixels, file size: 9 KB)
 | This is a file from the Wikimedia Commons. Information from its description page there is shown below. Commons is a freely licensed media file repository. You can help. |
Summary
| Description |
English: First step in demonstrating Dirac's theorem that all graphs of individual degrees ≥ n / 2 are hamiltonian : build a cycle out of the longest path |
| Date | |
| Source | Own work |
| Author | MathsPoetry |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 20:37, 3 January 2013 | | 665 × 328 (9 KB) | MathsPoetry | Fixed the name of one of the nodes |
| 13:24, 3 January 2013 |  | 665 × 328 (9 KB) | MathsPoetry | User created page with UploadWizard |
File usage
The following pages on the English Wikipedia use this file (pages on other projects are not listed):
Global file usage
The following other wikis use this file:
- Usage on fr.wikipedia.org
