Zdeněk Dvořák

From MaRDI portal
Person:213911

Available identifiers

zbMath Open dvorak.zdenekDBLPd/ZdenekDvorakWikidataQ24005021 ScholiaQ24005021MaRDI QIDQ213911

List of research outcomes





PublicationDate of PublicationType
Representation of short distances in structurally sparse graphs2024-10-08Paper
Asymptotic dimension of intersection graphs2024-10-07Paper
Weak diameter coloring of graphs on surfaces2024-09-30Paper
Solution to a problem of Grünbaum on the edge density of 4-critical planar graphs2024-09-19Paper
A strengthening and an efficient implementation of Alon-Tarsi list coloring method2024-02-19Paper
Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations2024-01-29Paper
Precoloring extension in planar near-Eulerian-triangulations2023-12-20Paper
Solution to a problem of Gr\"unbaum on the edge density of $4$-critical planar graphs2023-11-06Paper
Induced odd cycle packing number, independent sets, and chromatic number2023-10-12Paper
On weighted sublinear separators2023-10-05Paper
Coloring count cones of planar graphs2023-10-05Paper
Flexibility of triangle‐free planar graphs2023-09-29Paper
Single‐conflict colouring2023-09-29Paper
Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs.2023-09-20Paper
Correspondence coloring of random graphs2023-07-27Paper
Maximum edge colouring problem on graphs that exclude a fixed minor2023-07-05Paper
Clustered coloring of (path+2K_1)-free graphs on surfaces2023-06-16Paper
On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs2023-06-14Paper
Embedded graph 3-coloring and flows2023-03-09Paper
Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\)2023-01-23Paper
Additive non-approximability of chromatic number in proper minor-closed classes2022-11-23Paper
Product structure of graph classes with strongly sublinear separators2022-08-22Paper
https://portal.mardi4nfdi.de/entity/Q50889412022-07-18Paper
Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings2022-06-10Paper
Square roots of nearly planar graphs2022-05-25Paper
11/4-colorability of subcubic triangle-free graphs2022-04-26Paper
Representation of short distances in structurally sparse graphs2022-04-19Paper
Flexibility of planar graphs of girth at least six2022-03-31Paper
On Comparable Box Dimension2022-03-15Paper
Characterization of 4-critical triangle-free toroidal graphs2022-03-03Paper
Asymptotic dimension of intersection graphs2022-02-15Paper
Notes on graph product structure theory2021-12-10Paper
Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm2021-11-17Paper
Weak diameter coloring of graphs on surfaces2021-11-13Paper
Additive non-approximability of chromatic number in proper minor-closed classes2021-07-28Paper
Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs2021-07-06Paper
Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies2021-07-06Paper
A Thomassen-type method for planar graph recoloring2021-06-18Paper
Sublinear Separators in Intersection Graphs of Convex Shapes2021-06-10Paper
1-subdivisions, the fractional chromatic number and the Hall ratio2021-04-16Paper
Cyclic coloring of plane graphs with maximum face size 16 and 172021-04-14Paper
Weak Coloring Numbers of Intersection Graphs2021-03-31Paper
Approximation metatheorems for classes with bounded expansion2021-03-15Paper
A note on sublinear separators and expansion2021-02-08Paper
Bounding the number of cycles in a graph in terms of its degree sequence2021-02-08Paper
Coloring near-quadrangulations of the cylinder and the torus2021-02-08Paper
Baker game and polynomial-time approximation schemes2021-02-02Paper
An update on reconfiguring 10-colorings of planar graphs2021-01-29Paper
$(3a:a)$-List-Colorability of Embedded Graphs of Girth at Least Five2020-10-27Paper
On fractional fragility rates of graph classes2020-10-20Paper
A 4-choosable graph that is not (8:2)-choosable2020-10-20Paper
On decidability of hyperbolicity2020-10-04Paper
Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five2020-09-24Paper
Structure and generation of crossing-critical graphs2020-08-18Paper
Irreducible 4-critical triangle-free toroidal graphs2020-06-16Paper
Fractional Coloring of Planar Graphs of Girth Five2020-02-26Paper
Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows2020-02-26Paper
List coloring with requests2019-12-30Paper
Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable2019-08-30Paper
Independence number in triangle-free graphs avoiding a minor2019-07-30Paper
Treewidth of graphs with balanced separations2019-07-17Paper
On distance ‐dominating and ‐independent sets in sparse graphs2019-06-14Paper
List-coloring embedded graphs2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q46338182019-05-06Paper
https://portal.mardi4nfdi.de/entity/Q46339322019-05-06Paper
Triangle‐free planar graphs with the smallest independence number2019-03-28Paper
On generalized choice and coloring numbers2019-03-22Paper
Graphs avoiding immersion of K_{3,3}2019-03-21Paper
Flexibility of triangle-free planar graphs2019-02-08Paper
Triangle-free planar graphs with small independence number2018-12-20Paper
Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains2018-07-25Paper
Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk2018-07-24Paper
Complete graph immersions and minimum degree2018-07-13Paper
Induced 2-degenerate subgraphs of triangle-free planar graphs2018-05-25Paper
On classes of graphs with strongly sublinear separators2018-05-18Paper
Independent sets near the lower bound in bounded degree graphs2018-04-19Paper
Graphic TSP in cubic graphs2018-04-19Paper
Planar graphs have two-coloring number at most 82018-04-18Paper
Single-conflict colouring2018-03-29Paper
Density of 5/2-critical graphs2018-03-16Paper
Thin graph classes and polynomial-time approximation schemes2018-03-15Paper
Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 82018-02-09Paper
Irreducible 4-critical triangle-free toroidal graphs2018-01-18Paper
Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows2018-01-18Paper
Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces2018-01-12Paper
Induced subdivisions and bounded expansion2017-12-21Paper
Islands in minor-closed classes. I. Bounded treewidth and separators2017-10-07Paper
Triangle-free graphs of tree-width \(t\) are \(\lceil (t+3)/2 \rceil\)-colorable2017-09-11Paper
Do triangle-free planar graphs have exponentially many 3-colorings?2017-09-08Paper
Large Independent Sets in Triangle-Free Planar Graphs2017-06-23Paper
Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles2017-05-24Paper
5-choosability of graphs with crossings far apart2017-01-26Paper
5-list-coloring planar graphs with distant precolored vertices2016-11-25Paper
Crossing numbers of periodic graphs2016-10-13Paper
A structure theorem for strong immersions2016-10-13Paper
Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.2016-06-03Paper
Strongly sublinear separators and polynomial expansion2016-05-26Paper
Packing six \(T\)-joins in plane graphs2015-12-11Paper
Immersion in four-edge-connected graphs2015-12-11Paper
Sublinear separators, fragility and subexponential expansion2015-12-11Paper
Fractional coloring of triangle-free planar graphs2015-11-02Paper
On Planar Boolean CSP2015-10-27Paper
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle2015-09-29Paper
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle2015-09-15Paper
Chromatic number and complete graph substructures for degree sequences2015-01-09Paper
Large Independent Sets in Triangle-Free Planar Graphs2014-10-08Paper
A Dynamic Data Structure for MSO Properties in Graphs with Bounded Tree-Depth2014-10-08Paper
Three-coloring triangle-free planar graphs in linear time2014-09-09Paper
Planar 4-critical graphs with four triangles2014-09-02Paper
A minimum degree condition forcing complete graph immersion2014-08-14Paper
Subcubic triangle-free graphs have fractional chromatic number at most 14/52014-07-28Paper
4-Critical Graphs on Surfaces Without Contractible $(\le\!4)$-Cycles2014-06-19Paper
Strong Immersions and Maximum Degree2014-06-19Paper
https://portal.mardi4nfdi.de/entity/Q54200122014-06-11Paper
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs2014-04-25Paper
Distance-two coloring of sparse graphs2014-03-25Paper
Testing first-order properties for subclasses of sparse graphs2014-02-17Paper
3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart2014-02-06Paper
List-coloring apex-minor-free graphs2014-01-07Paper
A simplified discharging proof of Gr\"otzsch theorem2013-11-29Paper
Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract)2013-10-10Paper
A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs2013-08-12Paper
Star Chromatic Index2013-04-19Paper
Constant-factor approximation of the domination number in sparse graphs2013-03-19Paper
Spectrally degenerate graphs: hereditary case2012-10-19Paper
A stronger structure theorem for excluded topological minors2012-09-01Paper
Bipartizing fullerenes2012-06-18Paper
Forbidden graphs for tree-depth2012-05-04Paper
Classes of graphs with small rank decompositions are \(\chi \)-bounded2012-05-04Paper
Graphs with Two Crossings Are 5-Choosable2012-03-15Paper
Choosability of planar graphs of girth 52011-09-13Paper
3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles2011-06-17Paper
Randić index and the diameter of a graph2011-03-04Paper
On recognizing graphs by numbers of homomorphisms2010-11-24Paper
Spectral radius of finite and infinite planar graphs and of graphs of bounded genus2010-11-05Paper
Crossing-critical graphs with large maximum degree2010-06-03Paper
Distance constrained labelings of planar graphs with no short cycles2010-04-28Paper
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs2010-04-22Paper
Small graph classes and bounded expansion2010-04-21Paper
Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs2010-03-29Paper
Pattern hypergraphs2010-03-26Paper
On a Rado type problem for homogeneous second order linear recurrences2010-03-26Paper
k-Chromatic Number of Graphs on Surfaces2010-03-17Paper
Matchings and Nonrainbow Colorings2010-03-17Paper
Algorithms for Classes of Graphs with Bounded Expansion2010-01-21Paper
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable2009-12-15Paper
A note on antisymmetric flows in graphs2009-12-01Paper
Graph Drawing2009-08-11Paper
Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph2009-05-27Paper
List-Coloring Squares of Sparse Subcubic Graphs2009-03-16Paper
Two-factors in orientated graphs with forbidden transitions2009-01-28Paper
On forbidden subdivision characterizations of graph classes2008-05-29Paper
Coloring Triangle-Free Graphs on Surfaces2008-05-27Paper
Coloring squares of planar graphs with girth six2008-05-13Paper
https://portal.mardi4nfdi.de/entity/Q54431962008-02-20Paper
Noncrossing Hamiltonian paths in geometric graphs2007-06-08Paper
Four gravity results2007-02-13Paper
Probabilistic strategies for the partition and plurality problems2007-02-07Paper
Eulerian colorings and the bipartizing matchings conjecture of Fleischner2006-11-15Paper
Algorithms and Computation2006-11-14Paper
A Theorem About a Contractible and Light Edge2006-06-01Paper
Locally consistent constraint satisfaction problems2006-01-09Paper
STACS 20052005-12-02Paper
Algorithm Theory - SWAT 20042005-09-07Paper
Automata, Languages and Programming2005-08-24Paper
Coloring face hypergraphs on surfaces2005-01-11Paper
https://portal.mardi4nfdi.de/entity/Q44144942003-07-25Paper
On planar mixed hypergraphs2001-12-11Paper
Sparsity of 3-flow critical graphsN/APaper

Research outcomes over time

This page was built for person: Zdeněk Dvořák