11 citations · 18 across the 17 of their papers we have counts for
4 papers · 1 filter
Robinson-Schensted shapes arising from cycle decompositions
Martha Du Preez, William Q. Erickson, Jonathan Feigert +5
In the symmetric group , each element has an associated cycle type , a partition of that identifies the conjugacy class of . The Robinson-Schensted (RS) correspo…
Neighborhood Balanced 3-Coloring
Mitchell Minyard, Mark R. Sepanski
A graph is said to be neighborhood 3-balanced if there exists a vertex labeling with three colors so that each vertex has an equal number of neighbors of each color. We give order…
Limits and Periodicity of Metamour -Distance Graphs
William Q. Erickson, Daniel Herden, Jonathan Meddaugh +3
Given a finite simple graph , let denote its 2-distance graph, in which two vertices are adjacent if and only if they have distance 2 in . In this paper…
On Criticality and Additivity of the Pseudoachromatic Number Under Join
Jonathan Meddaugh, Mark R. Sepanski, Yegnanarayanan Venkataraman
A vertex coloring of a graph is said to be pseudocomplete if, for any two distinct colors, there exists at least one edge with those two colors as its end vertices. The pseudoachro…