<?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-22T22:08:25Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/13174" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/13174</identifier><datestamp>2025-03-26T23:32:50Z</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="advisor">Cheriyan, Joseph</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="ecac56f1-59be-47de-a075-17b2ba1fe519" confidence="600">Mousavi Haji, Seyyed Ramin</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2018-04-25T20:43:59Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2018-04-25T20:43:59Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2018-04-25</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2018-04-23</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/13174</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Let 𝐺=(𝑉,𝐸) be a graph and let 𝑇 be a spanning tree of 𝐺. The thinness parameter of 𝑇 denoted by 𝜌(𝑇) is the maximum over all cuts of the proportion of the edges of 𝑇 in the cut. Thin trees play an important role in some recent papers on the Asymmetric Traveling Salesman Problem (ATSP). Goddyn conjectured that every graph of sufficiently large edge-connectivity has a spanning tree 𝑇 such that 𝜌(𝑇) ≤ 𝜀.&#xd;
In this thesis, we study the problem of finding thin spanning trees in two families of graphs, namely, (1) distance-regular graphs (DRGs), and (2) planar graphs.&#xd;
&#xd;
For some families of DRGs such as strongly regular graphs, Johnson graphs, Crown graphs, and Hamming graphs, we give a polynomial-time construction of spanning trees 𝑇 of maximum degree ≤ 3 such that 𝜌(𝑇) is determined by the parameters of the graph.&#xd;
&#xd;
For planar graphs, we improve the analysis of Merker and Postle (&amp;quot;Bounded Diameter Arboricity&amp;quot;, arXiv:1608.05352v1) and show that every 6-edge-connected planar graph has two edge-disjoint spanning trees 𝑇,𝑇′ such that 𝜌(𝑇),𝜌(𝑇′) ≤ 14⁄15. For 8-edge-connected planar graphs 𝐺, we present a simplified version of the techniques of Merker and Postle and show that 𝐺 has two edge-disjoint spanning trees 𝑇,𝑇′ such that 𝜌(𝑇),𝜌(𝑇′) ≤ 12⁄13.</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="title" lang="en">Thin Trees in Some Families of 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" qualifier="discipline" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Cheriyan, Joseph</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</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>