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 (232)
Orphanage
Unclass'd
Unproven (519)
Corrections (21)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

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

Let $ G$ be a graph. If $ G$ has a Hamiltonian path, we say that $ G$ is traceable.

Not every traceable graph is Hamiltonian. As an example consider Petersen's graph.



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

View style:

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

Cross-references: Petersen's graph, Hamiltonian, Hamiltonian path, graph
There is 1 reference to this entry.

This is version 4 of traceable, born on 2001-10-24, modified 2006-10-31.
Object id is 477, canonical name is Traceable.
Accessed 2599 times total.

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

No messages.

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