21 citations · 33 across the 5 of their papers we have counts for
6 papers
Linear Bounds for Cycle-free Saturation Games
Sean English, Tomáš Masařík, Grace McCourt +3
Given a family of graphs , we define the -saturation game as follows. Two players alternate adding edges to an initially empty graph on vertices, with…
Minkowski summands of cubes
Federico Castillo, Joseph Doolittle, Bennet Goeckner +2
In pioneering works of Meyer and of McMullen in the early 1970s, the set of Minkowski summands of a polytope was shown to be a polyhedral cone called the type cone. Explicit comput…
Using Markov chains to determine expected propagation time for probabilistic zero forcing
Yu Chan, Emelie Curl, Jesse Geneson +4
Zero forcing is a coloring game played on a graph where each vertex is initially colored blue or white and the goal is to color all the vertices blue by repeated use of a (determin…
Throttling processes equivalent to full throttling on trees
Michael S. Ross
Consider a discrete-time process on a graph where a set of initial vertices are chosen to be colored blue (the remainder being white) and then a time step consists of every…
Throttling positive semidefinite zero forcing propagation time on graphs
Joshua Carlson, Leslie Hogben, Jürgen Kritschgau +4
Zero forcing is a process on a graph that colors vertices blue by starting with some of the vertices blue and applying a color change rule. Throttling minimizes the sum of the size…
2-Swappability and the Edge-Reconstruction Number of Regular Graphs
Michael S. Ross
The edge-reconstruction number of graph , denoted ,is the size of the smallest multiset of edge-deleted, unlabeled subgraphs of , from which the structure of can…