Browsing Theses by Subject "Combinatorial analysis"
Now showing items 1-2 of 2
-
Finding Independent Transversals Efficiently
(University of Waterloo, 2019-08-23)Let G be a graph and (V_1,...,V_m) be a vertex partition of G. An independent transversal (IT) of G with respect to (V_1,...,V_m) is an independent set {v_1,...,v_m} in G such that v_i is in V_i for each i in {1,...,m}. There ... -
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 ...