The Libraries will be performing routine maintenance on UWSpace on October 13th, 2025, from 8 - 9 am ET. UWSpace will be unavailable during this time. Service should resume by 9 am ET.

Browsing by Author "Reinert, Nathan"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • No Thumbnail Available
    Item
    Forbidding odd K3,3 as a graft minor
    (University of Waterloo, 2025-10-06) Reinert, Nathan
    A graph is odd−K5 free if K5 cannot be obtained by deleting edges and then contracting all edges in a cut. odd − K5 free graphs play an important role in the study of multi-commodity flows. A graph is odd − K3,3 free if K3,3 cannot be obtained by contracting edges and then deleting all edges in an eulerian subgraph. A long-standing conjecture of Paul Seymour predicts that postman sets pack in odd − K3,3 free graphs. We study odd − K3,3 free graphs that are almost planar in this thesis and discuss the relation to Seymour’s conjecture.