Melissa S. Keranen

activity

20112018

most citedOn the Hamilton-Waterloo Problem with triangle factors and

C_{3 x}

-factors

14 citations · 20 across the 6 of their papers we have counts for

collaborators

7 papers

math.CO2018★ 1 cited

$TS (v, λ)$ with cyclic 2-intersecting Gray codes: $v \equiv 0$ or $4 (mod 12)$

John Asplund, Melissa Keranen

A $TS (v, λ)$ is a pair $(V, B)$ where $V$ contains $v$ points and $B$ contains $3$ -element subsets of $V$ so that each pair in $V$ appears in exactly $λ$ b…

math.CO2017

On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity

Melissa Keranen, Adrián Pastine

The Hamilton-Waterloo problem asks for a decomposition of the complete graph into $r$ copies of a 2-factor $F_{1}$ and $s$ copies of a 2-factor $F_{2}$ such that $r+s=\left\lfloor\…

math.CO2017★ 1 cited

Technical report Existence of Kirkman signal sets on $v = 1, 3 (mod 6)$ points, $14 \leq v \leq 3000$

Melissa S. Keranen, Donald L. Kreher

A partial Steiner triple system whose triples can be partitioned into $s$ partial parallel classes, each of size $m$ , is a $s i g na l$ $se t$ , denoted $\mbox{SS}(v,s,m)$. A $K i r k man$ $…

math.CO2016

A Generalization of the Hamilton-Waterloo Problem on Complete Equipartite Graphs

Melissa Keranen, Adrián Pastine

The Hamilton-Waterloo problem asks for which $s$ and $r$ the complete graph $K_{n}$ can be decomposed into $s$ copies of a given 2-factor $F_{1}$ and $r$ copies of a given 2-factor $F_…

math.CO2015★ 14 cited

On the Hamilton-Waterloo Problem with triangle factors and $C_{3 x}$ -factors

John Asplund, David Kamin, Melissa Keranen +2

The Hamilton-Waterloo Problem (HWP) in the case of $C_{m}$ -factors and $C_{n}$ -factors asks if $K_{v}$ , where $v$ is odd (or $K_{v} - F$ , where $F$ is a 1-factor and $v$ is even), can be…

cs.DM2014★ 4 cited

Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs

Melissa Keranen, Juho Lauri

A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of verti…

math.CO2011

Fixed block configuration group divisible designs with block size six

Melissa Keranen, Melanie Laffin

We present constructions and results about GDDs with two groups and block size 6. We study those GDDs in which each block has configuration (s,t), that is in which each block has e…