92 citations · 106 across the 20 of their papers we have counts for
25 papers
Temporal Role Colouring
Jessica Enright, Kitty Meeks, Puck Rombach +1
A role colouring of a graph is an assignment of colours to the vertices of such that two vertices of the same colour have identical sets of colours in their neighbourhoods.…
Vertex addition to a ball graph with application to reliability and area coverage in autonomous swarms
Calum Buchanan, Puck Rombach, James Bagrow +1
A unit ball graph consists of a set of vertices, labeled by points in Euclidean space, and edges joining all pairs of points within distance 1. These geometric graphs are used to m…
The Saturation Spectrum of Berge Stars
Neal Bushaw, Sean English, Emily Heath +2
The forbidden subgraph problem is among the oldest in extremal combinatorics -- how many edges can an -vertex -free graph have? The answer to this question is the well-studie…
On odd covers of cliques and disjoint unions
Calum Buchanan, Alexander Clifton, Eric Culver +5
Babai and Frankl posed the ``odd cover problem" of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order…
Positroid envelopes and graphic positroids
Jeremy Quail, Puck Rombach
Positroids are matroids realizable by real matrices with all nonnegative maximal minors. They partition the ordered matroids into equivalence classes, called positroid envelope cla…
A lower bound on the saturation number and a strengthening for triangle-free graphs
Calum Buchanan, Puck Rombach
The saturation number of a graph and positive integer is the minimum size of a graph of order which does not contain a subgraph isomorphic to…