Browsing Combinatorics and Optimization by Subject "Graph theory"
Now showing items 1-5 of 5
-
Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces
(University of Waterloo, 2020-05-05)In 1972, Tutte posed the 3-Flow Conjecture: that all 4-edge-connected graphs have a nowhere zero 3-flow. This was extended by Jaeger et al. (1992) to allow vertices to have a prescribed, possibly non-zero difference (modulo ... -
On Schnyder's Theorm
(University of Waterloo, 2010-08-20)The central topic of this thesis is Schnyder's Theorem. Schnyder's Theorem provides a characterization of planar graphs in terms of their poset dimension, as follows: a graph G is planar if and only if the dimension of ... -
Quantum independence and chromatic numbers
(University of Waterloo, 2019-08-28)In this thesis we are studying the cases when quantum independence and quantum chromatic numbers coincide with or differ from their classical counterparts. Knowing about the relation of chromatic numbers separation to the ... -
Quantum State Transfer in Graphs
(University of Waterloo, 2014-08-13)Let X be a graph, A its adjacency matrix, and t a non-negative real number. The matrix exp(i t A) determines the evolution in time of a certain quantum system defined on the graph. It represents a continuous-time quantum ... -
Simple Drawings of Kn from Rotation Systems
(University of Waterloo, 2021-10-06)A complete rotation system on n vertices is a collection of n cyclic permutations of the elements [n]\{i}, for i∈[n]. If D is a drawing of a labelled graph, then a rotation at vertex v is the cyclic ordering of the edges ...