
Approximation schemes for bounded distance problems on fractionally treewidthfragile graphs
We give polynomialtime approximation schemes for monotone maximization ...
read it

Weak Coloring Numbers of Intersection Graphs
Weak and strong coloring numbers are generalizations of the degeneracy o...
read it

Approximation metatheorem for fractionally treewidthfragile graphs
Baker's technique is a powerful tool for designing polynomialtime appro...
read it

On decidability of hyperbolicity
We prove that a wide range of coloring problems in graphs on surfaces ca...
read it

Notes on Graph Product Structure Theory
It was recently proved that every planar graph is a subgraph of the stro...
read it

Induced odd cycle packing number, independent sets, and chromatic number
The induced odd cycle packing numberiocp(G) of a graph G is the maximum ...
read 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...
read it

Bounded maximum degree conjecture holds precisely for ccrossingcritical graphs with c ≤ 12
We study ccrossingcritical graphs, which are the minimal graphs that r...
read 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...
read it

Flexibility of trianglefree planar graphs
Let G be a planar graph with a list assignment L. Suppose a preferred co...
read it

Baker game and polynomialtime approximation schemes
Baker devised a technique to obtain approximation schemes for many optim...
read it

Least conflict choosability
Given a multigraph, suppose that each vertex is given a local assignment...
read it

Structure and generation of crossingcritical graphs
We study ccrossingcritical graphs, which are the minimal graphs that r...
read it

On distance rdominating and 2rindependent sets in sparse graphs
Dvorak (2013) gave a bound on the minimum size of a distance r dominatin...
read it

On classes of graphs with strongly sublinear separators
For real numbers c,epsilon>0, let G_c,epsilon denote the class of graphs...
read it

Induced 2degenerate Subgraphs of Trianglefree Planar Graphs
A graph is kdegenerate if every subgraph has minimum degree at most k. ...
read it
Zdeněk Dvořák
is this you? claim profile