16 citations · 75 across the 37 of their papers we have counts for
46 papers
A short proof of Seymour's 6-flow theorem
Matt DeVos, Kathryn Nurse
We give a compact variation of Seymour's proof that every -edge-connected graph has a nowhere-zero -flow.
Cycles through two edges in signed graphs
Matt DeVos, Kathryn Nurse
We give a characterization of when a signed graph with a pair of distinguished edges has the property that all cycles containing both and have t…
Another proof of Seymour's 6-flow theorem
Matt DeVos, Jessica McDonald, Kathryn Nurse
In 1981 Seymour proved his famous 6-flow theorem asserting that every 2-edge-connected graph has a nowhere-zero flow in the group (in fact, he…
Longer cycles in vertex transitive graphs
Matt DeVos
In 1979 Babai found a clever argument to prove that every connected vertex transitive graph on vertices contains a cycle of length at least . Here we modify hi…
There are only a finite number of excluded minors for the class of bicircular matroids
Matt DeVos, Daryl Funk, Luis Goddyn +1
We show that the class of bicircular matroids has only a finite number of excluded minors. Key tools used in our proof include representations of matroids by biased graphs and the…
Many flows in the group connectivity setting
Matt DeVos, Rikke Langhede, Bojan Mohar +1
Two well-known results in the world of nowhere-zero flows are Jaeger's 4-flow theorem asserting that every 4-edge-connected graph has a nowhere-zero $\mathbb{Z}_2 \times \mathbb{Z}…