
On classes of graphs with strongly sublinear separators
For real numbers c,epsilon>0, let G_c,epsilon denote the class of graphs...
10/09/2017 ∙ by Zdeněk Dvořák, et al. ∙ 0 ∙ shareread it

Induced 2degenerate Subgraphs of Trianglefree Planar Graphs
A graph is kdegenerate if every subgraph has minimum degree at most k. ...
09/12/2017 ∙ by Zdeněk Dvořák, et al. ∙ 0 ∙ shareread it

On distance rdominating and 2rindependent sets in sparse graphs
Dvorak (2013) gave a bound on the minimum size of a distance r dominatin...
10/27/2017 ∙ by Zdeněk Dvořák, et al. ∙ 0 ∙ shareread it

Least conflict choosability
Given a multigraph, suppose that each vertex is given a local assignment...
03/29/2018 ∙ by Zdeněk Dvořák, et al. ∙ 0 ∙ shareread it

Structure and generation of crossingcritical graphs
We study ccrossingcritical graphs, which are the minimal graphs that r...
03/05/2018 ∙ by Zdeněk Dvořák, et al. ∙ 0 ∙ shareread it

Baker game and polynomialtime approximation schemes
Baker devised a technique to obtain approximation schemes for many optim...
01/07/2019 ∙ by Zdeněk Dvořák, et al. ∙ 0 ∙ shareread it

Flexibility of trianglefree planar graphs
Let G be a planar graph with a list assignment L. Suppose a preferred co...
02/08/2019 ∙ by Zdeněk Dvořák, et al. ∙ 0 ∙ shareread it

Flexibility of planar graphs of girth at least six
Let G be a planar graph with a list assignment L. Suppose a preferred co...
02/11/2019 ∙ by Zdeněk Dvořák, et al. ∙ 0 ∙ shareread it

Bounded maximum degree conjecture holds precisely for ccrossingcritical graphs with c ≤ 12
We study ccrossingcritical graphs, which are the minimal graphs that r...
03/13/2019 ∙ by Drago Bokal, et al. ∙ 0 ∙ shareread it

Coloring nearquadrangulations of the cylinder and the torus
Let G be a simple connected plane graph and let C_1 and C_2 be cycles in...
09/26/2019 ∙ by Zdeněk Dvořák, et al. ∙ 0 ∙ shareread it
Zdeněk Dvořák
is this you? claim profile