made with Mathematica technology MathWorld
Algebra
Applied Mathematics
Calculus and Analysis
Discrete Mathematics
Foundations of Mathematics
Geometry
History and Terminology
Number Theory
Probability and Statistics
Recreational Mathematics
Topology
Alphabetical Index
Interactive Entries
Random Entry
New in MathWorld
MathWorld Classroom
About MathWorld
Contribute to MathWorld
Send a Message to the Team
MathWorld Book
12,905 entries
Last updated: Mon Jan 5 2009

Created, developed, and nurtured by Eric Weisstein
at Wolfram Research
Discrete Mathematics > Graph Theory > Circuits >

Dirac's Theorem
DOWNLOAD Mathematica Notebook

A simple graph with n>=3 graph vertices in which each graph vertex has vertex degree >=n/2 has a Hamiltonian circuit.

SEE ALSO: Hamiltonian Circuit




CITE THIS AS:

Weisstein, Eric W. "Dirac's Theorem." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/DiracsTheorem.html

SendContact the MathWorld Team
© 1999-2009 Wolfram Research, Inc. | Terms of Use

The Wolfram Demonstrations Project Browse Topics View Latest
JUST RELEASED: Wolfram Mathematica 7
 Other Wolfram Web Resources »
Wolfram Research
Mathematica Home Page
Mathematica Documentation Center
Wolfram Demonstrations Project
Online Integrator
Functions Site
Wolfram Tones
Wolfram Science
Wolfram Blog
more…