Hamilton Paths in Generalized Petersen Graphs
This thesis puts forward the conjecture that for <i>n</i> > 3<i>k</i> with <i>k</i> > 2, the generalized Petersen graph, <i>GP</i>(<i>n,k</i>) is Hamilton-laceable if <i>n</i> is even and <i>k</i> is odd, and i...
Main Author: | Pensaert, William |
---|---|
Format: | Others |
Language: | en |
Published: |
University of Waterloo
2006
|
Subjects: | |
Online Access: | http://hdl.handle.net/10012/1198 |
Similar Items
-
Hamilton Paths in Generalized Petersen Graphs
by: Pensaert, William
Published: (2006) -
Hamilton Cycles in Double Generalized Petersen Graphs
by: Sakamoto Yutaro
Published: (2019-02-01) -
Matching Preclusion of the Generalized Petersen Graph
by: Ajay Arora, et al.
Published: (2019-05-01) -
α-Labelings of a Class of Generalized Petersen Graphs
by: Benini Anna, et al.
Published: (2015-02-01) -
Graceful labelings of the generalized Petersen graphs
by: Zehui, et al.
Published: (2017-12-01)