We prove that for every planar graph X of treedepth h, there exists a
po...
Hadwiger's Conjecture asserts that every K_h-minor-free graph is properl...
We prove that for every tree T of radius h, there is an integer c such
t...
We investigate the product structure of hereditary graph classes admitti...
We determine which properties of 2-layer drawings characterise bipartite...
We show that many graphs with bounded treewidth can be described as subg...
In a reduction sequence of a graph, vertices are successively identified...
We prove that the stack-number of the strong product of three n-vertex
p...
Dujmović, Joret, Micek, Morin, Ueckerdt and Wood [J. ACM 2020] proved th...
Let G be a connected n-vertex graph in a proper minor-closed class
𝒢. We...
Layered treewidth and row treewidth are recently introduced graph parame...
We describe a family of graphs with queue-number at most 4 but unbounded...
A vertex colouring of a graph G is "nonrepetitive" if G contains no path...
Given a fixed graph H that embeds in a surface Σ, what is the
maximum nu...
Tree-chromatic number is a chromatic version of treewidth, where the cos...
It was recently proved that every planar graph is a subgraph of the stro...
Hajós conjectured that every graph containing no subdivision of the
comp...
Dujmović et al. (FOCS 2019) recently proved that every planar graph is a...
A colouring of a graph is "nonrepetitive" if for every path of even orde...
We show that planar graphs have bounded queue-number, thus proving a
con...
We prove that graphs with bounded degree and bounded Euler genus have bo...
We prove that a minor-closed class of graphs has bounded layered pathwid...
The crossing number of a graph is the minimum number of crossings in a
d...
An (improper) graph colouring has "defect" d if each monochromatic subgr...
An (improper) graph colouring has "defect" d if each monochromatic subgr...
We prove that the dimension of every poset whose comparability graph has...
Let P be a set of n points in strictly convex position in the plane. Let...
We prove the conjecture of Seymour (1993) that for every apex-forest H_1...
This paper studies questions about duality between crossings and
non-cro...