9 citations · 21 across the 11 of their papers we have counts for
4 papers · 1 filter
Mutually orthogonal binary frequency squares
Thomas Britz, Nicholas J. Cavenagh, Adam Mammoliti +1
A \emph{frequency square} is a matrix in which each row and column is a permutation of the same multiset of symbols. We consider only {\em binary} frequency squares of order wi…
Latin squares with maximal partial transversals of many lengths
Anthony B. Evans, Adam Mammoliti, Ian Wanless
A partial transversal of a Latin square is a set of entries of in which each row, column and symbol is represented at most once. A partial transversal is maximal if it…
The cyclic matching sequenceability of regular graphs
Daniel Horsley, Adam Mammoliti
The cyclic matching sequenceability of a simple graph , denoted , is the largest integer for which there exists a cyclic ordering of the edges of so tha…
The -matching sequencibility of complete multi--partite -graphs
Adam Mammoliti
Alspach [{\sl Bull. Inst. Combin. Appl.}~{\bf 52} (2008), 7--20] defined the maximal matching sequencibility of a graph , denoted~, to be the largest integer for whic…