## You are here

HomeHamiltonian graph

## Primary tabs

# Hamiltonian graph

A graph $G$ is *Hamiltonian* if it has a Hamiltonian cycle.

A useful condition both necessary and sufficient for a graph to be Hamiltonian is not known. Ore’s theorem and the Bondy and Chvátal theorem give sufficient conditions, while a necessary condition follows quickly from the definition, namely:

Let $G=(V,E)$ be a graph of order at least 3. If $G$ is Hamiltonian, then for every proper subset $U$ of $V$, the subgraph induced by $V-U$ has at most $|U|$ components.

Related:

HamiltonianCycle, HamiltonianPath, OresTheorem, BondyAndChvatalTheorem, PetersensGraph, Traceable

Synonym:

Hamiltonian

Type of Math Object:

Definition

Major Section:

Reference

Groups audience:

## Mathematics Subject Classification

05C45*no label found*55-00

*no label found*82-00

*no label found*83-00

*no label found*81-00

*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Sep 17

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella