PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (211)
Orphanage
Unclass'd (1)
Unproven (472)
Corrections (36)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Legalese
About
Owner confidence rating: Medium Entry average rating: No information on entry rating
Hamiltonian path (Definition)

Let $ G$ be a graph. A path on $ G$ that includes every vertex exactly once is called a Hamiltonian path.



"Hamiltonian path" is owned by drini. [ full author list (2) | owner history (1) ]
(view preamble)

View style:

See Also: Hamiltonian cycle, Hamiltonian graph, Petersen graph, traceable
Log in to rate this entry.
(view current ratings)

Cross-references: vertex, path, graph
There are 4 references to this entry.

This is version 5 of Hamiltonian path, born on 2001-10-24, modified 2006-10-23.
Object id is 475, canonical name is HamiltonianPath.
Accessed 5861 times total.

Classification:
AMS MSC: 05C45 (Combinatorics :: Graph theory :: Eulerian and Hamiltonian graphs)
Pending Errata and Addenda
None.
[ View all 2 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)