1 citations · 1 across the 2 of their papers we have counts for
7 papers
Generalizing forbidden induced subgraph characterizations of high throttling numbers
Jurgen Kritschgau, Josh Carlson
Zero forcing is a process that models the spread of information throughout a graph as white vertices are forced to turn blue using a color change rule. The idea of throttling, intr…
Cutoff in the Bernoulli-Laplace model with swaps
Joseph S. Alameda, Caroline Bang, Zachary Brennan +3
This paper considers the -Bernoulli--Laplace model in the case when there are two urns, the total number of red and white balls is the same, and the number of selections …
Rainbow Solutions to the Sidon Equation in Cyclic Groups
Zhanar Berikkyzy, Jürgen Kritschgau
Given a coloring of group elements, a rainbow solution to an equation is a solution whose every element is assigned a different color. The rainbow number of for an e…
On leaky forcing and resilience
Joseph S. Alameda, Jürgen Kritschgau, Nathan Warnberg +1
A leak is a vertex that is not allowed to perform a force during the zero forcing process. Leaky forcing was recently introduced as a new variation of zero forcing in order to anal…
Rainbow matchings of size in graphs with total color degree at least
J\''{u}rgen Kritschgau
The existence of a rainbow matching given a minimum color degree, proper coloring, or triangle-free host graph has been studied extensively. This paper, generalizes these problems…
Rainbow numbers for in
Erin Bevilacqua, Samuel King, Jürgen Kritschgau +3
In this work, we investigate the fewest number of colors needed to guarantee a rainbow solution to the equation in . This value is called the Rain…