UWSpace will be migrating to a new version of its software from July 29th to August 1st. UWSpace will be offline for all UW community members during this time.

Show simple item record

dc.contributor.authorBedsole, Carter
dc.date.accessioned2023-04-25 12:41:05 (GMT)
dc.date.available2023-04-25 12:41:05 (GMT)
dc.date.issued2023-04-25
dc.date.submitted2023-04-21
dc.identifier.urihttp://hdl.handle.net/10012/19317
dc.description.abstractThe crossing number of a graph is the minimum number of pairwise edge crossings in a drawing of the graph in the plane. A graph G is k-crossing-critical if its crossing number is at least k and if every proper subgraph H of G has crossing number less than k. It follows directly from Kuratowski's Theorem that the 1-crossing-critical graphs are precisely the subdivisions of K{3,3} and K5. Characterizing the 2-crossing-critical graphs is an interesting open problem. Much progress has been made in characterizing the 2-crossing-critical graphs. The only remaining unexplained such graphs are those which are 3-connected, have a V8 minor but no V10 minor, and embed in the real projective plane. This thesis seeks to extend previous attempts at classifying this particular set of graphs by examining the graphs in this category where a tree structure is attached to a subdivision of V8. In this paper, we analyze which of the 106 possible 3-stars can be attached to a subdivision H of V8 in a 3-connected 2-crossing-critical graph. This analysis leads to a strong result, where we demonstrate that if a k-star is attached to a V8 in a 2-crossing-critical graph, then k <= 4. Finally, we significantly restrict the remaining trees which still need to be investigated under the same conditions.en
dc.language.isoenen
dc.publisherUniversity of Waterlooen
dc.subjectgraph theoryen
dc.subject2-crossing-criticalen
dc.subjecttopological graph theoryen
dc.subjectstructural graph theoryen
dc.titleAnalyzing Tree Attachments in 2-Crossing-Critical Graphs with a V8 Minoren
dc.typeMaster Thesisen
dc.pendingfalse
uws-etd.degree.departmentCombinatorics and Optimizationen
uws-etd.degree.disciplineCombinatorics and Optimizationen
uws-etd.degree.grantorUniversity of Waterlooen
uws-etd.degreeMaster of Mathematicsen
uws-etd.embargo.terms0en
uws.contributor.advisorRichter, Bruce
uws.contributor.affiliation1Faculty of Mathematicsen
uws.published.cityWaterlooen
uws.published.countryCanadaen
uws.published.provinceOntarioen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages