J. Asplund

activity

20152025

most citedA Vizing-type result for semi-total domination

15 citations · 64 across the 24 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

math.CO2015

$m$ -Cycle Packings of $(λ + μ) K_{v + u} - λ K_{v}$ : $m$ even

John Asplund

A $λ K_{v}$ is a complete graph on $v$ vertices with $λ$ edges between each pair of the $v$ vertices. A $(λ + μ) K_{v + u} - λ K_{v}$ is a $(λ + μ) K_{v + u}$ with the edge set of $λ K_{v}$ removed. De…

math.CO2015

Packing paths in a $(λ + μ) K_{v + u} - λ K_{v}$

John Asplund, Joe Chaffee, James M. Hammer

Following standard terminology, $λ K_{v}$ is a multigraph on $v$ vertices such that $λ$ edges join each pair of vertices. Let $(λ + μ) K_{v + u} - λ K_{v}$ be the graph $(V \cup U, E)$ with $|V|=…

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…

m-Cycle Packings of (λ+μ)Kv+u​−λKv​: m even

Packing paths in a (λ+μ)Kv+u​−λKv​

On the Hamilton-Waterloo Problem with triangle factors and C3x​-factors

$m$ -Cycle Packings of $(λ + μ) K_{v + u} - λ K_{v}$ : $m$ even

Packing paths in a $(λ + μ) K_{v + u} - λ K_{v}$

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