John Asplund

Enumerating cycles in the graph of overlapping permutations

The graph of overlapping permutations is a directed graph that is an analogue to the De Bruijn graph. It consists of vertices that are permutations of length

Reconfiguration graphs of shortest paths

n

k-planar crossing number of random graphs and random regular graphs

and edges that are permutations of length

Decomposition of a Complete Bipartite Multigraph into Arbitrary Cycle Sizes

n+1

On a limit of the method of Tashkinov trees for edge-colouring

in which an edge

On the Hamilton-Waterloo Problem with triangle factors and

a_1\cdots a_{n+1}

C_{3x}

would connect the standardization of

-factors

a_1\cdots a_n

Using Block Designs in Crossing Number Bounds.

to the standardization of

Classification of Reconfiguration Graphs of Shortest Path Graphs With No Induced

a_2\cdots a_{n+1}