35 citations · 94 across the 13 of their papers we have counts for
Showing 2005 · math.COShow all
2 papers · 2 filters
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★ 1 cited
Notes on Nonrepetitive Graph Colouring
János Barát, David R. Wood
A vertex colouring of a graph is \emph{nonrepetitive on paths} if there is no path such that v_i and v_{t+i} receive the same colour for all i=1,2,...,t. We de…