<?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-22T14:40:32Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/9630" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/9630</identifier><datestamp>2017-03-21T15:17:34Z</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" authority="f3a7b571-b86c-43ed-9606-bff64da28f96" confidence="600">Haddadan, Arash</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2015-08-31T20:09:07Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-08-31T20:09:07Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2015-08-31</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2015-08-31</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/9630</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">We study the following two problems: (1) finding a second room-partitioning of an oik, and (2) finding a second Hamiltonian cycle in cubic graphs. The existence of solution for both problems is guaranteed by a parity argument.&#xd;
&#xd;
 For the first problem we prove that deciding whether a 2-oik has a room-partitioning is NP-hard, even if the 2-oik corresponds to a planar triangulation. &#xd;
&#xd;
For the problem of finding a second Hamiltonian cycle, we state the following conjecture: for every cubic planar bipartite graph finding a second Hamiltonian cycle can be found in time linear in the number of vertices via a standard pivoting algorithm. We fail to settle the conjecture, but we prove it for cubic planar bipartite WH(6)-minor free graphs.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Parity argument</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">oik</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">room-partitioning</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">exchange algorithm</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">cubic graph</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Barnette&amp;apos;s conjecture</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Finding a Second Hamiltonian cycle in Barnette Graphs</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">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>