research
∙
08/23/2023
Cliquewidth and dimension
We prove that every poset with bounded cliquewidth and with sufficiently...
share
research
∙
07/06/2023
The grid-minor theorem revisited
We prove that for every planar graph X of treedepth h, there exists a po...
research
∙
03/27/2023
The Excluded Tree Minor Theorem Revisited
We prove that for every tree T of radius h, there is an integer c such t...
research
∙
02/06/2023
Tight bound on treedepth in terms of pathwidth and longest path
We show that every graph with pathwidth strictly less than a that contai...
research
∙
11/21/2022
Treedepth vs circumference
The circumference of a graph G is the length of a longest cycle in G, or...
research
∙
06/14/2022
Boolean dimension and dim-boundedness: Planar cover graph with a zero
In 1989, Nešetřil and Pudlák posed the following challenging question: D...
research
∙
06/19/2020
Tight Bounds on The Clique Chromatic Number
The clique chromatic number of a graph is the minimum number of colours ...
research
∙
04/15/2020
Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
Enumerating minimal transversals in a hypergraph is a notoriously hard p...
research
∙
03/09/2020
Adjacency Labelling for Planar Graphs (and Beyond)
We show that there exists an adjacency labelling scheme for planar graph...
research
∙
02/02/2020
Excluding a ladder
Which graph classes C exclude a fixed ladder as a minor? We show that th...
research
∙
06/30/2019
Dimension is polynomial in height for posets with planar cover graphs
We show that height h posets that have planar cover graphs have dimensio...
research
∙
04/09/2019
Planar Graphs have Bounded Queue-Number
We show that planar graphs have bounded queue-number, thus proving a con...
research
∙
06/12/2018
The queue-number of posets of bounded width or height
Heath and Pemmaraju conjectured that the queue-number of a poset is boun...
research
∙
06/12/2018
The queue-number of planar posets
Heath and Pemmaraju conjectured that the queue-number of a poset is boun...
research
∙
01/05/2018
Seymour's conjecture on 2-connected graphs of large pathwidth
We prove the conjecture of Seymour (1993) that for every apex-forest H_1...
research
∙
08/17/2017