98 citations · 109 across the 10 of their papers we have counts for
11 papers
Playing Games with Cacti
Samuel Adefiyiju, Heather Baranek, Abigail Daly +4
The Game of Cycles is a two-player impartial mathematical game, introduced by Francis Su in his book Mathematics for Human Flourishing (2020). The game is played on simple planar g…
Product Throttling
Sarah E. Anderson, Karen L. Collins, Daniela Ferrero +4
Throttling addresses the question of minimizing the sum or the product of the resources used to accomplish a task and the time needed to complete that task for various graph search…
Product throttling for power domination
Sarah E. Anderson, Karen L. Collins, Daniela Ferrero +4
The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power…
The Game of Cycles
Ryan Alvarado, Maia Averett, Benjamin Gaines +5
The Game of Cycles, introduced by Su (2020), is played on a simple connected planar graph together with its bounded cells, and players take turns marking edges with arrows accordin…
Improved bounds for induced poset saturation
Ryan R. Martin, Heather C. Smith, Shanise Walker
Given a finite poset , a family of elements in the Boolean lattice is induced--saturated if contains no copy of …
Anti-van der Waerden numbers on Graphs
Zhanar Berikkyzy, Alex Schulte, Elizabeth Sprangel +3
In this paper arithmetic progressions on the integers and the integers modulo n are extended to graphs. This allows for the definition of the anti-van der Waerden number of a graph…
A simple discharging method for forbidden subposet problems
Ryan R. Martin, Abhishek Methuku, Andrew Uzzell +1
The poset consists of distinct elements , , \dots, , ,, such that ,~. The poset $Y'_{k+1…
An algebraic Monte-Carlo algorithm for the Partition Adjacency Matrix realization problem
Eva Czabarka, Laszlo A. Szekely, Zoltan Toroczkai +1
The graphical realization of a given degree sequence and given partition adjacency matrix simultaneously is a relevant problem in data driven modeling of networks. Here we formulat…
Injective choosability of subcubic planar graphs with girth 6
Boris Brimkov, Jennifer Edmond, Robert Lazar +3
An injective coloring of a graph is an assignment of colors to the vertices of so that any two vertices with a common neighbor have distinct colors. A graph is injectiv…
A note on the size of N-free families
Ryan R. Martin, Shanise Walker
The poset consists of four distinct sets such that , , and where is not necessarily a subset of . A family $\mat…
Propagation time for zero forcing on a graph
Leslie Hogben, My Huynh, Nicole Kingsley +3
Zero forcing (also called graph infection) on a simple, undirected graph is based on the color-change rule: If each vertex of is colored either white or black, and vertex $…