UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Cyclically 5-Connected Graphs

Thumbnail Image

Files

Chen_Da.pdf (718.41 KB)

Date

2016-08-29

Authors

Chen, Da Qi

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

Tutte's Four-Flow Conjecture states that every bridgeless, Petersen-free graph admits a nowhere-zero 4-flow. This hard conjecture has been open for over half a century with no significant progress in the first forty years. In the recent decades, Robertson, Thomas, Sanders and Seymour has proved the cubic version of this conjecture. Their strategy involved the study of the class of cyclically 5-connected cubic graphs. It turns out a minimum counterexample to the general Four-Flow Conjecture is also cyclically 5-connected. Motivated by this fact, we wish to find structural properties of this class in hopes of producing a list of minor-minimal cyclically 5-connected graphs.

Description

Keywords

Graph Theory, Graph Flows, Structural Graph Theory

LC Keywords

Citation

URI

http://hdl.handle.net/10012/10711

Collections

Theses
Combinatorics and Optimization