31 citations · 256 across the 67 of their papers we have counts for
8 papers · 1 filter
On decidability of hyperbolicity
Zdeněk Dvořák, Luke Postle
We prove that a wide range of coloring problems in graphs on surfaces can be resolved by inspecting a finite number of configurations.
Characterization of 4-critical triangle-free toroidal graphs
Zdeněk Dvořák, Jakub Pekárek
We give an exact characterization of 3-colorability of triangle-free graphs drawn in the torus, in the form of 186 "templates" (graphs with certain faces filled by arbitrary quadra…
A Thomassen-type method for planar graph recoloring
Zdeněk Dvořák, Carl Feghali
The reconfiguration graph for the -colorings of a graph has as vertices all possible -colorings of and two colorings are adjacent if they differ in the color…
An update on reconfiguring -colorings of planar graphs
Zdeněk Dvořák, Carl Feghali
The reconfiguration graph for the -colorings of a graph has as vertex set the set of all possible proper -colorings of and two colorings are adjacent if they…
Sublinear separators in intersection graphs of convex shapes
Zdenek Dvorak, Rose McCarty, Sergey Norin
We give a natural sufficient condition for an intersection graph of compact convex sets in R^d to have a balanced separator of sublinear size. This condition generalizes several pr…
A note on sublinear separators and expansion
Zdeněk Dvořák
For a hereditary class C of graphs, let s_C(n) be the minimum function such that each n-vertex graph in C has a balanced separator of order at most s_C(n), and let nabla_C(r) be th…