4 citations · 8 across the 3 of their papers we have counts for
5 papers
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 $…
The k-planar crossing number of random graphs and random regular graphs
John Asplund, Thao Do, Arran Hamm +3
We give an explicit extension of Spencer's result on the biplanar crossing number of the Erdos-Renyi random graph . In particular, we show that the k-planar crossing number…
Minimum Coprime Labelings for Operations on Graphs
John Asplund, N. Bradley Fox
A prime labeling of a graph of order is a labeling of the vertices with the integers to~ in which adjacent vertices have relatively prime labels. A coprime labeling main…
Reconfiguration graphs of shortest paths
John Asplund, Kossi Edoh, Ruth Haas +3
For a graph and , the shortest path reconfiguration graph of with respect to and is denoted by . The vertex set of is the set of a…
On a limit of the method of Tashkinov trees for edge-colouring
John Asplund, Jessica McDonald
The main technique used to edge-colour graphs requiring or more colours is the method of Tashkinov trees. We present a specific limit to this method, in terms of Kempe change…