Jump to content

File:Dirac theorem.svg

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Original file (SVG file, nominally 665 × 328 pixels, file size: 9 KB)

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:
w:en:Creative Commons
attribution share alike
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.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

3 January 2013

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current20:37, 3 January 2013Thumbnail for version as of 20:37, 3 January 2013665 × 328 (9 KB)MathsPoetryFixed the name of one of the nodes
13:24, 3 January 2013Thumbnail for version as of 13:24, 3 January 2013665 × 328 (9 KB)MathsPoetryUser created page with UploadWizard

The following page uses this file:

Global file usage

The following other wikis use this file:

Metadata