Calum Buchanan

collaborators

2 papers

math.CO2022

Toughness of recursively partitionable graphs

Calum Buchanan, Brandon Du Preez, K. E. Perry +1

A simple graph $G = (V, E)$ on $n$ vertices is said to be recursively partitionable (RP) if $G ≃ K_{1}$ , or if $G$ is connected and satisfies the following recursive property: for…

math.CO2022

Odd Covers of Graphs

Calum Buchanan, Alexander Clifton, Eric Culver +4

Given a finite simple graph $G$ , an odd cover of $G$ is a collection of complete bipartite graphs, or bicliques, in which each edge of $G$ appears in an odd number of bicliques and…