15 citations · 64 across the 24 of their papers we have counts for
9 papers · 1 filter
Enclosings of Decompositions of Complete Multigraphs in -Edge-Connected -Factorizations
John Asplund, Pierre Charbit, Carl Feghali
A decomposition of a multigraph is a partition of its edges into subgraphs . It is called an -factorization if every is -regular and spanning.…
Pebbling on Directed Graphs with Fixed Diameter
John Asplund, Franklin Kenter
Pebbling is a game played on a graph. The single player is given a graph and a configuration of pebbles and may make pebbling moves by removing 2 pebbles from one vertex and placin…
Classification of Reconfiguration Graphs of Shortest Path Graphs With No Induced -cycles
John Asplund, Brett Werner
For any graph with , a shortest path reconfiguration graph can be formed with respect to and ; we denote such a graph as . The vertex set of $S(G,…
Using Block Designs in Crossing Number Bounds
John Asplund, Eva Czabarka, Gregory Clark +6
The crossing number ${\mbox {cr}}(G)$ of a graph is the smallest number of edge crossings over all drawings of in the plane. For any , the -planar crossing…
with cyclic 2-intersecting Gray codes: or
John Asplund, Melissa Keranen
A is a pair where contains points and contains -element subsets of so that each pair in appears in exactly b…
New Perspectives on Neighborhood-Prime Labelings of Graphs
John Asplund, N. Bradley Fox, Arran Hamm
Neighborhood-prime labeling is a variation of prime labeling. A labeling is a neighborhood-prime labeling if for each vertex with degree greater t…
On the k-planar local crossing number
John Asplund, Thao do, Arran Hamm +1
Given a fixed positive integer , the -planar local crossing number of a graph , denoted by , is the minimum positive integer such that can be deco…
A Vizing-type result for semi-total domination
John Asplund, Randy Davila, Elliot Krop
A set of vertices in a simple isolate-free graph is a semi-total dominating set of if it is a dominating set of and every vertex of is within distance 2 or less…
Pebbling on Graph Products and other Binary Graph Constructions
John Asplund, Glenn Hurlbert, Franklin Kenter
Pebbling on graphs is a two-player game which involves repeatedly moving a pebble from one vertex to another by removing another pebble from the first vertex. The pebbling number $…