<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T18:31:16Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/1198" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/1198</identifier><datestamp>2017-03-21T19:49:03Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en" authority="2275f0f7-bcd5-4f26-ab6b-09e9e78f5a69" confidence="600">Pensaert, William</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-22T14:20:02Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-22T14:20:02Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2002</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2002</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/1198</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">This thesis puts forward the conjecture that for &amp;lt;i&amp;gt;n&amp;lt;/i&amp;gt; &amp;gt; 3&amp;lt;i&amp;gt;k&amp;lt;/i&amp;gt; with &amp;lt;i&amp;gt;k&amp;lt;/i&amp;gt; &amp;gt; 2, the generalized Petersen graph, &amp;lt;i&amp;gt;GP&amp;lt;/i&amp;gt;(&amp;lt;i&amp;gt;n,k&amp;lt;/i&amp;gt;) is Hamilton-laceable if &amp;lt;i&amp;gt;n&amp;lt;/i&amp;gt; is even and &amp;lt;i&amp;gt;k&amp;lt;/i&amp;gt; is odd, and it is Hamilton-connected otherwise.    We take the first step in the proof of this conjecture by proving the case &amp;lt;i&amp;gt;n&amp;lt;/i&amp;gt; = 3&amp;lt;i&amp;gt;k&amp;lt;/i&amp;gt; + 1 and &amp;lt;i&amp;gt;k&amp;lt;/i&amp;gt; greater than or equal to 1.    We do this mainly by means of an induction which takes us from &amp;lt;i&amp;gt;GP&amp;lt;/i&amp;gt;(3&amp;lt;i&amp;gt;k&amp;lt;/i&amp;gt; + 1, &amp;lt;i&amp;gt;k&amp;lt;/i&amp;gt;) to &amp;lt;i&amp;gt;GP&amp;lt;/i&amp;gt;(3(&amp;lt;i&amp;gt;k&amp;lt;/i&amp;gt; + 2) + 1, &amp;lt;i&amp;gt;k&amp;lt;/i&amp;gt; + 2).    The induction takes the form of mapping a Hamilton path in the smaller graph piecewise to the larger graph an inserting subpaths we call &amp;lt;i&amp;gt;rotors&amp;lt;/i&amp;gt; to obtain a Hamilton path in the larger graph.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">183802 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">Copyright: 2002, 
  Pensaert, William. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Mathematics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">graph theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">mathematics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">combinatorics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Hamilton paths</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">generalized Petersen graphs</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Hamilton Paths in Generalized Petersen Graphs</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>