The following pages link to Zdeněk Dvořák (Q213911):
Displaying 46 items.
- A 4-choosable graph that is not (8:2)-choosable (Q5126751) (← links)
- $(3a:a)$-List-Colorability of Embedded Graphs of Girth at Least Five (Q5128509) (← links)
- Baker game and polynomial-time approximation schemes (Q5146926) (← links)
- Matchings and Nonrainbow Colorings (Q5189521) (← links)
- <i>k</i>-Chromatic Number of Graphs on Surfaces (Q5189531) (← links)
- Graph Drawing (Q5193169) (← links)
- List coloring with requests (Q5207462) (← links)
- Fractional Coloring of Planar Graphs of Girth Five (Q5217825) (← links)
- Large Independent Sets in Triangle-Free Planar Graphs (Q5270410) (← links)
- Algorithm Theory - SWAT 2004 (Q5315376) (← links)
- Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles (Q5346562) (← links)
- On distance ‐dominating and ‐independent sets in sparse graphs (Q5379844) (← links)
- Coloring Triangle-Free Graphs on Surfaces (Q5387740) (← links)
- Testing first-order properties for subclasses of sparse graphs (Q5395732) (← links)
- (Q5420012) (← links)
- (Q5443196) (← links)
- Automata, Languages and Programming (Q5466486) (← links)
- A Theorem About a Contractible and Light Edge (Q5470816) (← links)
- Subcubic triangle-free graphs have fractional chromatic number at most 14/5 (Q5494396) (← links)
- STACS 2005 (Q5710675) (← links)
- List-coloring embedded graphs (Q5741780) (← links)
- Algorithms for Classes of Graphs with Bounded Expansion (Q5851090) (← links)
- Algorithms and Computation (Q5897853) (← links)
- Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows (Q5915811) (← links)
- Irreducible 4-critical triangle-free toroidal graphs (Q5915812) (← links)
- Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows (Q5919454) (← links)
- On planar mixed hypergraphs (Q5948492) (← links)
- Flexibility of triangle‐free planar graphs (Q6055413) (← links)
- Single‐conflict colouring (Q6055933) (← links)
- Coloring count cones of planar graphs (Q6057584) (← links)
- Induced odd cycle packing number, independent sets, and chromatic number (Q6074594) (← links)
- Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. (Q6075929) (← links)
- On weighted sublinear separators (Q6081561) (← links)
- On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs (Q6098458) (← links)
- Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations (Q6184892) (← links)
- Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs (Q6251001) (← links)
- Flexibility of triangle-free planar graphs (Q6313788) (← links)
- Approximation metatheorems for classes with bounded expansion (Q6362934) (← links)
- Weak Coloring Numbers of Intersection Graphs (Q6364240) (← links)
- On Comparable Box Dimension (Q6393719) (← links)
- Sparsity of 3-flow critical graphs (Q6528506) (← links)
- Solution to a problem of Grünbaum on the edge density of 4-critical planar graphs (Q6607843) (← links)
- Weak diameter coloring of graphs on surfaces (Q6612521) (← links)
- Asymptotic dimension of intersection graphs (Q6614397) (← links)
- Representation of short distances in structurally sparse graphs (Q6615133) (← links)
- Towards Characterization of 5-List-Colorability of Toroidal Graphs (Q6738110) (← links)
