6 papers · 1 filter
The excluded minors for -gainable and regular biased graphs
Nick Brettell, Rutger Campbell, Daryl Funk +1
We prove that a biased graph is gainable over the group if and only if it contains no minor isomorphic to , , or . We develo…
A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
Sam Bastida, Nick Brettell
For a graph with at least two vertices, the maximum local edge-connectivity of is the maximum number of edge-disjoint -paths over all distinct pairs of vertices $(u,…
The excluded minors of the class of spike minors
Sam Bastida, Nick Brettell, Rutger Campbell +4
Mayhew et al.\ (2021) posed the problem of showing that the minor-closed class of spikes and their minors has a finite set of excluded minors and describing all of them. In this pa…
Detachable pairs in -connected matroids and simple -connected graphs
Nick Brettell, Charles Semple, Gerry Toft
Let be a -connected matroid. A pair in is detachable if or is -connected. Williams (2015) proved that if has a…
-detachable pairs in 3-connected matroids II: life in
Nick Brettell, Geoff Whittle, Alan Williams
Let be a 3-connected matroid, and let be a 3-connected minor of . A pair is -detachable if one of the matroids or $M \backsla…
-detachable pairs in 3-connected matroids I: unveiling
Nick Brettell, Geoff Whittle, Alan Williams
Let be a 3-connected matroid, and let be a 3-connected minor of . We say that a pair is -detachable if one of the matroids or…