Browsing Theses by Subject "signed graph"
Now showing items 1-3 of 3
-
Chromatic Number of Random Signed Graphs
(University of Waterloo, 2024-05-03)We naturally extend Bollobas's classical method and result about the chromatic number of random graphs chi(G(n,p)) ~ n/log_b(n) (for p constant, b=1/(1-p)) to the chromatic number of random signed graphs to obtain chi(G(n,p,q)) ... -
The Cycling Property for the Clutter of Odd st-Walks
(University of Waterloo, 2014-01-23)A binary clutter is cycling if its packing and covering linear program have integral optimal solutions for all Eulerian edge capacities. We prove that the clutter of odd st- walks of a signed graph is cycling if and only ... -
Representations of even-cycle and even-cut matroids
(University of Waterloo, 2021-08-27)In this thesis, two classes of binary matroids will be discussed: even-cycle and even-cut matroids, together with problems which are related to their graphical representations. Even-cycle and even-cut matroids can be ...