4 citations · 8 across the 4 of their papers we have counts for
13 papers · 1 filter
Minimum Coprime Labelings of Generalized Petersen and Prism Graphs
John Asplund, N. Bradley Fox
A coprime labeling of a graph of order is an assignment of distinct positive integer labels in which adjacent vertices have relatively prime labels. Restricting labels to only…
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…