<?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-22T16:09:05Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/8494" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/8494</identifier><datestamp>2017-03-21T21:45:00Z</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="7e98fc83-529d-4c48-84c9-8be33f09c01a" confidence="600">Arroyo Guevara, Alan Marcelo</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2014-05-22T17:51:23Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2014-05-22T17:51:23Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2014-05-22</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2014-05-20</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/8494</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">The crossing number of a graph is the minimum number of pairwise edge crossings in a drawing of a graph. A graph $G$ is $k$-crossing-critical if it has crossing number at least $k$, and any subgraph of $G$ has crossing number less than $k$. A consequence of Kuratowski&amp;apos;s theorem is that 1-critical graphs are subdivisions of $K_{3,3}$ and $K_{5}$. The graph $V_{2n}$ is a $2n$-cycle with $n$ diameters.  Bokal,  Oporowski,&#xd;
 Richter and  Salazar found in \cite{bigpaper} all the critical graphs except the ones that contain a $V_{8}$ minor and no $V_{10}$ minor. &#xd;
&#xd;
We show that  a 4-connected graph $G$ has crossing number at least 2 if and only if for each pair of disjoint edges  there are two disjoint cycles containing them. Using a generalization of this result we found limitations for the 2-crossing-critical graphs remaining to classify. We showed that  peripherally 4-connected 2-crossing-critical graphs have at most 4001 vertices. Furthermore, most 3-connected 2-crossing-critical graphs are obtainable by small modifications of the peripherally 4-connected ones.</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 theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">crossing numbers</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">disjoint paths</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">crossing critical</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">On 2-crossing-critical graphs with a V8-minor</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>