David R. Wood

most citedBounded-Degree Graphs have Arbitrarily Large Geometric Thickness

10 citations · 12 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2008

Distinct Distances in Graph Drawings

Paz Carmi, Vida Dujmović, Pat Morin +1

The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-…

math.CO2008★ 1 cited

Folding = Colouring

David R. Wood

The foldings of a connected graph $G$ are defined as follows. First, $G$ is a folding of itself. Let $G^{'}$ be a graph obtained from $G$ by identifying two vertices at distance 2 in…