<?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-22T11:32:19Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/4716" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/4716</identifier><datestamp>2017-03-21T17:09:02Z</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="ede2c617-8868-4900-8526-0ac7595fdd0a" confidence="600">Huynh, Tony</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2009-09-24T15:59:53Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2009-09-24T15:59:53Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2009-09-24T15:59:53Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2009</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/4716</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">This thesis aims to extend some of the results of the Graph Minors Project of Robertson and Seymour to &amp;quot;group-labelled graphs&amp;quot;.  Let $\Gamma$ be a group. A $\Gamma$-labelled graph is an oriented graph with its edges labelled from $\Gamma$, and is thus a generalization of a signed graph.  &#xd;
&#xd;
Our primary result is a generalization of the main result from Graph Minors XIII.  For any finite abelian group $\Gamma$, and any fixed $\Gamma$-labelled graph $H$, we present a polynomial-time algorithm that determines if an input $\Gamma$-labelled graph $G$ has an $H$-minor.  The correctness of our algorithm relies on much of the machinery developed throughout the graph minors papers. We therefore hope it can serve as a reasonable introduction to the subject.&#xd;
&#xd;
Remarkably, Robertson and Seymour also prove that for any sequence $G_1, G_2, \dots$ of graphs, there exist indices $i&amp;lt;j$ such that $G_i$ is isomorphic to a minor of $G_j$.  Geelen, Gerards and Whittle recently announced a proof of the analogous result for $\Gamma$-labelled graphs, for $\Gamma$ finite abelian.  Together with the main result of this thesis, this implies that membership in any minor closed class of $\Gamma$-labelled graphs can be decided in polynomial-time.  This also has some  implications for well-quasi-ordering certain classes of matroids, which we discuss.</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="subject" lang="en">graph minors</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">matroids</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">The Linkage Problem for Group-labelled Graphs</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral 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">Doctor of Philosophy</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>