Added to Favorites

Related Searches

In graph theory, there are two theorems that are commonly referred to as Dirac's theorem, both named after the mathematician Gabriel Andrew Dirac:

- Let G be a k-connected graph. Then for any set of k vertices in G, there exists a cycle in G that passes through all k vertices.
- Let G be a graph on n ≥ 3 vertices. If each vertex has degree at least n/2 then G is hamiltonian.

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Friday January 05, 2007 at 13:26:43 PST (GMT -0800)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Friday January 05, 2007 at 13:26:43 PST (GMT -0800)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2014 Dictionary.com, LLC. All rights reserved.