7 citations · 14 across the 16 of their papers we have counts for
3 papers · 1 filter
Class-uniformly resolvable designs with all but one block having size two
Karen Cordova, Alexander J. Diesl, Micaela Roth +1
A Class-Uniformly Resolvable Design (CURD) is a resolvable design in which each parallel class has the same block structure. We study CURDS in which each parallel class contains on…
Discrete-time treatment number of binary trees
Karen L. Collins, Margaret-Ellen Messinger, Ann N. Trenk
The discrete-time treatment number of a graph , denoted by , was introduced in arXiv:2408.0531(3) and arises from a deterministic process in which each vertex is assigned…
Color -switches and neighborhood -balanced graphs with colors
Karen L. Collins, Jonelle Hook, Cayla McBee +1
This paper examines vertex colorings of graphs with constraints on the distribution of colors in vertex neighborhoods. We introduce color 2-switches and color degree matrices. The…