473 citations · 2k across the 152 of their papers we have counts for
7 papers · 1 filter
Proximity Drawings of High-Degree Trees
Ferran Hurtado, Giuseppe Liotta, David R. Wood
A drawing of a given (abstract) tree that is a minimum spanning tree of the vertex set is considered aesthetically pleasing. However, such a drawing can only exist if the tree has…
Partitions and Coverings of Trees by Bounded-Degree Subtrees
David R. Wood
This paper addresses the following questions for a given tree and integer : (1) What is the minimum number of degree- subtrees that partition ? (2) What is the…
The Big-Line-Big-Clique Conjecture is False for Infinite Point Sets
Attila~Pór, David R. Wood
The big-line-big-clique conjecture states that for all there is an integer such that every finite set of at least points in the plane contains collinea…
Colouring the Square of the Cartesian Product of Trees
David R. Wood
We prove upper and lower bounds on the chromatic number of the square of the cartesian product of trees. The bounds are equal if each tree has even maximum degree.
Thomassen's Choosability Argument Revisited
David R. Wood, Svante Linusson
Thomassen (1994) proved that every planar graph is 5-choosable. This result was generalised by {Š}krekovski (1998) and He et al. (2008), who proved that every -minor-free grap…
Small Minors in Dense Graphs
Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis +1
A fundamental result in structural graph theory states that every graph with large average degree contains a large complete graph as a minor. We prove this result with the extra pr…