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

3 papers

math.CO2005

Drawing a Graph in a Hypercube

David R. Wood

A $d$ -dimensional hypercube drawing of a graph represents the vertices by distinct points in ${0, 1}^{d}$ , such that the line-segments representing the edges do not cross. We study…

math.CO2005★ 10 cited

Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness

Janos Barat, Jiri Matousek, David R. Wood

The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separa…

math.CO2005★ 2 cited

Induced Subgraphs of Bounded Degree and Bounded Treewidth

Prosenjit Bose, Vida Dujmovic, David R. Wood

We prove that for all $0 \leq t \leq k$ and $d \geq 2 k$ , every graph $G$ with treewidth at most $k$ has a `large' induced subgraph $H$ , where $H$ has treewidth at most $t$ and every v…