Arran Hamm

activity

20122018

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

1 citations · 1 across the 1 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018

Using Block Designs in Crossing Number Bounds

John Asplund, Eva Czabarka, Gregory Clark +6

The crossing number ${\mbox {cr}}(G)$ of a graph $G = (V, E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k \geq 1$ , the $k$ -planar crossing…

math.CO2018

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 $f : V (G) \to [∣ V (G) ∣]$ is a neighborhood-prime labeling if for each vertex $v \in V (G)$ with degree greater t…

math.CO2018

On the k-planar local crossing number

John Asplund, Thao do, Arran Hamm +1

Given a fixed positive integer $k$ , the $k$ -planar local crossing number of a graph $G$ , denoted by $LCR_{k} (G)$ , is the minimum positive integer $L$ such that $G$ can be deco…