31 citations · 256 across the 67 of their papers we have counts for
98 papers
Extremal function for rooted minors
Zdeněk Dvořák
We show that if an n-vertex 5-connected graph has at least 4n-10 edges, then for any choice of five of its vertices, we can contract disjoint connected subgraphs containing these v…
Correspondence coloring of random graphs
Zdenek Dvorak, Liana Yepremyan
We show that Erdős-Rényi random graphs with constant density have correspondence chromatic number ; this matches a prediction from linear Hadwige…
Maximum edge colouring problem on graphs that exclude a fixed minor
Zdeněk Dvořák, Abhiruk Lahiri
The maximum edge colouring problem considers the maximum colour assignment to edges of a graph under the condition that every vertex has at most a fixed number of distinct coloured…
Embedded graph 3-coloring and flows
Caroline Bang, Zdeněk Dvořák, Emily Heath +1
A graph drawn in a surface is a near-quadrangulation if the sum of the lengths of the faces different from 4-faces is bounded by a fixed constant. We leverage duality between color…
Product structure of graph classes with strongly sublinear separators
Zdeněk Dvořák, David R. Wood
We investigate the product structure of hereditary graph classes admitting strongly sublinear separators. We characterise such classes as subgraphs of the strong product of a star…
Square roots of nearly planar graphs
Zdeněk Dvořák, Benjamin Moore, Abhiruk Lahiri
We prove that it is NP-hard to decide whether a graph is the square of a 6-apex graph. This shows that the square root problem is not tractable for squares of sparse graphs (or eve…