• Publications
  • Influence
Even Cycle and Even Cut Matroids
In this thesis we consider two classes of binary matroids, even cycle matroids and even cut matroids. They are a generalization of graphic and cographic matroids respectively. We focus on two mainExpand
  • 15
  • 2
When does a biased graph come from a group labelling?
TLDR
A biased graph consists of a graph G together with a collection of distinguished cycles of G, called balanced, with the property that no theta subgraph contains exactly two balanced cycles. Expand
  • 10
  • 2
  • PDF
Biased graphs with no two vertex-disjoint unbalanced cycles
TLDR
We characterise the structure of graphs with no two vertex-disjoint unbalanced cycles, answering a question by Zaslavsky and generalising the results of Lovasz and Slilaty. Expand
  • 2
  • 2
  • PDF
Packing Steiner trees
Let T be a distinguished subset of vertices in a graph G. A T-Steiner tree is a subgraph of G that is a tree and that spans T. Kriesell conjectured that G contains k pairwise edge-disjoint T-SteinerExpand
  • 5
  • 1
  • PDF
Relationships between Pairs of Representations of Signed Binary Matroids
TLDR
We show how pairs of signed graphs with the same even cycles relate to pairs of grafts with thesame even cuts. Expand
  • 5
  • 1
Highly-connected planar cubic graphs with few or many Hamilton cycles
TLDR
In this paper we consider the number of Hamilton cycles in planar cubic graphs of high cyclic edge-connectivity, answering two questions raised by Chia and Thomassen about extremal graphs in these families. Expand
  • 1
  • 1
  • PDF
3-Flows with large support
TLDR
We prove that every 3-edge-connected graph $G$ has a 3-flow $\phi$ with the property that $|\mathop{supp}(\phi)| \ge \frac{5}{6} |E(G)|$. Expand
  • 1
  • 1
  • PDF
Highly contrasted responses of Mediterranean octocorals to climate change along a depth gradient
Climate change has a strong impact on marine ecosystems, including temperate species. Analysing the diversity of thermotolerance levels within species along with their genetic structure enables aExpand
  • 15
Stabilizer theorems for even cycle matroids
TLDR
A signed graph is a representation of an even cycle matroid M if the cycles of M correspond to the even cycles of that signed graph. Expand
  • 4
  • PDF
Maximum Size Binary Matroids with no AG(3, 2)-Minor are Graphic
TLDR
We prove that the maximum size of a simple binary matroid of rank $r \geq 5$ with no $AG(3,2)$-minor is $\binom{r+1}{2}$ and characterize those matroids achieving this bound. Expand
  • 8
  • PDF