
Separating layered treewidth and row treewidth
Layered treewidth and row treewidth are recently introduced graph parame...
read it

Stacknumber is not bounded by queuenumber
We describe a family of graphs with queuenumber at most 4 but unbounded...
read it

Nonrepetitive graph colouring
A vertex colouring of a graph G is "nonrepetitive" if G contains no path...
read it

Subgraph densities in a surface
Given a fixed graph H that embeds in a surface Σ, what is the maximum nu...
read it

Notes on Tree and Pathchromatic Number
Treechromatic number is a chromatic version of treewidth, where the cos...
read it

Notes on Graph Product Structure Theory
It was recently proved that every planar graph is a subgraph of the stro...
read it

Clustered Variants of Hajós' Conjecture
Hajós conjectured that every graph containing no subdivision of the comp...
read it

The structure of kplanar graphs
Dujmović et al. (FOCS 2019) recently proved that every planar graph is a...
read it

Planar graphs have bounded nonrepetitive chromatic number
A colouring of a graph is "nonrepetitive" if for every path of even orde...
read it

Planar Graphs have Bounded QueueNumber
We show that planar graphs have bounded queuenumber, thus proving a con...
read it

Queue Layouts of Graphs with Bounded Degree and Bounded Genus
We prove that graphs with bounded degree and bounded Euler genus have bo...
read it

Minorclosed graph classes with bounded layered pathwidth
We prove that a minorclosed class of graphs has bounded layered pathwid...
read it

Tight Upper Bounds on the Crossing Number in a MinorClosed Class
The crossing number of a graph is the minimum number of crossings in a d...
read it

Defective and Clustered Choosability of Sparse Graphs
An (improper) graph colouring has "defect" d if each monochromatic subgr...
read it

Defective and Clustered Colouring of Sparse Graphs
An (improper) graph colouring has "defect" d if each monochromatic subgr...
read it

Better bounds for poset dimension and boxicity
We prove that the dimension of every poset whose comparability graph has...
read it

The exact chromatic number of the convex segment disjointness graph
Let P be a set of n points in strictly convex position in the plane. Let...
read it

Seymour's conjecture on 2connected graphs of large pathwidth
We prove the conjecture of Seymour (1993) that for every apexforest H_1...
read it

Thickness and Antithickness of Graphs
This paper studies questions about duality between crossings and noncro...
read it
David R. Wood
is this you? claim profile