Zdeněk Dvořák

From MaRDI portal
(Redirected from Person:213911)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Representation of short distances in structurally sparse graphs2024-10-08Paper
Asymptotic dimension of intersection graphs
European Journal of Combinatorics
2024-10-07Paper
Weak diameter coloring of graphs on surfaces
European Journal of Combinatorics
2024-09-30Paper
Solution to a problem of Grünbaum on the edge density of 4-critical planar graphs
Combinatorica
2024-09-19Paper
A strengthening and an efficient implementation of Alon-Tarsi list coloring method
The Electronic Journal of Combinatorics
2024-02-19Paper
Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations
Journal of Combinatorial Theory. Series B
2024-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 number
Journal of Graph Theory
2023-10-12Paper
On weighted sublinear separators
Journal of Graph Theory
2023-10-05Paper
Coloring count cones of planar graphs
Journal of Graph Theory
2023-10-05Paper
Flexibility of triangle‐free planar graphs
Journal of Graph Theory
2023-09-29Paper
Single‐conflict colouring
Journal of Graph Theory
2023-09-29Paper
Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs.
(available as arXiv preprint)
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 Graphs
SIAM Journal on Discrete Mathematics
2023-06-14Paper
Embedded graph 3-coloring and flows2023-03-09Paper
Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\)
Combinatorica
2023-01-23Paper
Additive non-approximability of chromatic number in proper minor-closed classes
Journal of Combinatorial Theory. Series B
2022-11-23Paper
Product structure of graph classes with strongly sublinear separators2022-08-22Paper
scientific article; zbMATH DE number 7559214 (Why is no real title available?)
(available as arXiv preprint)
2022-07-18Paper
Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings
Journal of Combinatorial Theory. Series B
2022-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 six
Journal of Graph Theory
2022-03-31Paper
On Comparable Box Dimension2022-03-15Paper
Characterization of 4-critical triangle-free toroidal graphs
Journal of Combinatorial Theory. Series B
2022-03-03Paper
Asymptotic dimension of intersection graphs2022-02-15Paper
Notes on graph product structure theory
(available as arXiv preprint)
2021-12-10Paper
Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm
Journal of Combinatorial Theory. Series B
2021-11-17Paper
Weak diameter coloring of graphs on surfaces2021-11-13Paper
Additive non-approximability of chromatic number in proper minor-closed classes
(available as arXiv preprint)
2021-07-28Paper
Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs
Journal of Combinatorial Theory. Series B
2021-07-06Paper
Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies
Journal of Combinatorial Theory. Series B
2021-07-06Paper
A Thomassen-type method for planar graph recoloring
European Journal of Combinatorics
2021-06-18Paper
Sublinear separators in intersection graphs of convex shapes
SIAM Journal on Discrete Mathematics
2021-06-10Paper
1-subdivisions, the fractional chromatic number and the Hall ratio
Combinatorica
2021-04-16Paper
Cyclic coloring of plane graphs with maximum face size 16 and 17
European Journal of Combinatorics
2021-04-14Paper
Weak Coloring Numbers of Intersection Graphs2021-03-31Paper
Approximation metatheorems for classes with bounded expansion2021-03-15Paper
Coloring near-quadrangulations of the cylinder and the torus
European Journal of Combinatorics
2021-02-08Paper
A note on sublinear separators and expansion
European Journal of Combinatorics
2021-02-08Paper
Bounding the number of cycles in a graph in terms of its degree sequence
European Journal of Combinatorics
2021-02-08Paper
Baker game and polynomial-time approximation schemes
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
2021-02-02Paper
An update on reconfiguring 10-colorings of planar graphs
The Electronic Journal of Combinatorics
2021-01-29Paper
\((3a:a)\)-list-colorability of embedded graphs of girth at least five
SIAM Journal on Discrete Mathematics
2020-10-27Paper
A 4-choosable graph that is not \((8:2)\)-choosable
Advances in Combinatorics
2020-10-20Paper
On fractional fragility rates of graph classes
The Electronic Journal of Combinatorics
2020-10-20Paper
On decidability of hyperbolicity2020-10-04Paper
Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five
Journal of Combinatorial Theory. Series B
2020-09-24Paper
Structure and generation of crossing-critical graphs
(available as arXiv preprint)
2020-08-18Paper
Irreducible 4-critical triangle-free toroidal graphs
European Journal of Combinatorics
2020-06-16Paper
Fractional coloring of planar graphs of girth five
SIAM Journal on Discrete Mathematics
2020-02-26Paper
Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows
Combinatorica
2020-02-26Paper
List coloring with requests
Journal of Graph Theory
2019-12-30Paper
Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable
European Journal of Combinatorics
2019-08-30Paper
Independence number in triangle-free graphs avoiding a minor2019-07-30Paper
Treewidth of graphs with balanced separations
Journal of Combinatorial Theory. Series B
2019-07-17Paper
On distance \(r\)-dominating and \(2r\)-independent sets in sparse graphs
Journal of Graph Theory
2019-06-14Paper
List-coloring embedded graphs
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-05-15Paper
Coloring triangle-free graphs on surfaces2019-05-06Paper
scientific article; zbMATH DE number 7051288 (Why is no real title available?)2019-05-06Paper
Triangle-free planar graphs with the smallest independence number
Journal of Graph Theory
2019-03-28Paper
On generalized choice and coloring numbers
The Electronic Journal of Combinatorics
2019-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 number
European Journal of Combinatorics
2018-12-20Paper
Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains
SIAM Journal on Discrete Mathematics
2018-07-25Paper
Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk
Journal of Combinatorial Theory. Series B
2018-07-24Paper
Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk
Journal of Combinatorial Theory. Series B
2018-07-24Paper
Complete graph immersions and minimum degree
Journal of Graph Theory
2018-07-13Paper
Induced 2-degenerate subgraphs of triangle-free planar graphs
The Electronic Journal of Combinatorics
2018-05-25Paper
Induced 2-degenerate subgraphs of triangle-free planar graphs
The Electronic Journal of Combinatorics
2018-05-25Paper
On classes of graphs with strongly sublinear separators
European Journal of Combinatorics
2018-05-18Paper
Independent sets near the lower bound in bounded degree graphs
(available as arXiv preprint)
2018-04-19Paper
Graphic TSP in cubic graphs
(available as arXiv preprint)
2018-04-19Paper
Planar graphs have two-coloring number at most 8
Journal of Combinatorial Theory. Series B
2018-04-18Paper
Planar graphs have two-coloring number at most 8
Journal of Combinatorial Theory. Series B
2018-04-18Paper
Single-conflict colouring2018-03-29Paper
Density of 5/2-critical graphs
Combinatorica
2018-03-16Paper
Thin graph classes and polynomial-time approximation schemes2018-03-15Paper
Thin graph classes and polynomial-time approximation schemes
(available as arXiv preprint)
2018-03-15Paper
Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
Journal of Combinatorial Theory. Series B
2018-02-09Paper
Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows
Electronic Notes in Discrete Mathematics
2018-01-18Paper
Irreducible 4-critical triangle-free toroidal graphs
Electronic Notes in Discrete Mathematics
2018-01-18Paper
Fine structure of 4-critical triangle-free graphs. III: General surfaces
SIAM Journal on Discrete Mathematics
2018-01-12Paper
Induced subdivisions and bounded expansion
European Journal of Combinatorics
2017-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\)-colorable
European Journal of Combinatorics
2017-09-11Paper
Do triangle-free planar graphs have exponentially many 3-colorings?
The Electronic Journal of Combinatorics
2017-09-08Paper
Do triangle-free planar graphs have exponentially many 3-colorings?
The Electronic Journal of Combinatorics
2017-09-08Paper
Large independent sets in triangle-free planar graphs
SIAM Journal on Discrete Mathematics
2017-06-23Paper
Fine structure of 4-critical triangle-free graphs. II: Planar triangle-free graphs with two precolored 4-cycles
SIAM Journal on Discrete Mathematics
2017-05-24Paper
5-choosability of graphs with crossings far apart
Journal of Combinatorial Theory. Series B
2017-01-26Paper
5-list-coloring planar graphs with distant precolored vertices
Journal of Combinatorial Theory. Series B
2016-11-25Paper
Crossing numbers of periodic graphs
Journal of Graph Theory
2016-10-13Paper
A structure theorem for strong immersions
Journal of Graph Theory
2016-10-13Paper
Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
Journal of Combinatorial Theory. Series B
2016-06-03Paper
Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
Journal of Combinatorial Theory. Series B
2016-06-03Paper
Strongly sublinear separators and polynomial expansion
SIAM Journal on Discrete Mathematics
2016-05-26Paper
Packing six \(T\)-joins in plane graphs
Journal of Combinatorial Theory. Series B
2015-12-11Paper
Immersion in four-edge-connected graphs
Journal of Combinatorial Theory. Series B
2015-12-11Paper
Sublinear separators, fragility and subexponential expansion
European Journal of Combinatorics
2015-12-11Paper
Fractional coloring of triangle-free planar graphs
The Electronic Journal of Combinatorics
2015-11-02Paper
Fractional coloring of triangle-free planar graphs
The Electronic Journal of Combinatorics
2015-11-02Paper
On Planar Boolean CSP
Automata, Languages, and Programming
2015-10-27Paper
3-coloring triangle-free planar graphs with a precolored 8-cycle
Journal of Graph Theory
2015-09-29Paper
Chromatic number and complete graph substructures for degree sequences
Combinatorica
2015-01-09Paper
A dynamic data structure for MSO properties in graphs with bounded tree-depth
Algorithms - ESA 2014
2014-10-08Paper
Large independent sets in triangle-free planar graphs
Algorithms - ESA 2014
2014-10-08Paper
Three-coloring triangle-free planar graphs in linear time
ACM Transactions on Algorithms
2014-09-09Paper
Planar 4-critical graphs with four triangles
European Journal of Combinatorics
2014-09-02Paper
A minimum degree condition forcing complete graph immersion
Combinatorica
2014-08-14Paper
Subcubic triangle-free graphs have fractional chromatic number at most \(14/5\)
Journal of the London Mathematical Society
2014-07-28Paper
Strong immersions and maximum degree
SIAM Journal on Discrete Mathematics
2014-06-19Paper
4-critical graphs on surfaces without contractible \((\leq 4)\)-cycles
SIAM Journal on Discrete Mathematics
2014-06-19Paper
scientific article; zbMATH DE number 6303034 (Why is no real title available?)2014-06-11Paper
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs
(available as arXiv preprint)
2014-04-25Paper
Distance-two coloring of sparse graphs
European Journal of Combinatorics
2014-03-25Paper
Testing first-order properties for subclasses of sparse graphs
Journal of the ACM
2014-02-17Paper
3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart
Journal of Combinatorial Theory. Series B
2014-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)
Electronic Notes in Discrete Mathematics
2013-10-10Paper
A dynamic data structure for counting subgraphs in sparse graphs
Lecture Notes in Computer Science
2013-08-12Paper
Star Chromatic Index
Journal of Graph Theory
2013-04-19Paper
Constant-factor approximation of the domination number in sparse graphs
European Journal of Combinatorics
2013-03-19Paper
Spectrally degenerate graphs: hereditary case
Journal of Combinatorial Theory. Series B
2012-10-19Paper
A stronger structure theorem for excluded topological minors2012-09-01Paper
Bipartizing fullerenes
European Journal of Combinatorics
2012-06-18Paper
Forbidden graphs for tree-depth
European Journal of Combinatorics
2012-05-04Paper
Classes of graphs with small rank decompositions are \(\chi \)-bounded
European Journal of Combinatorics
2012-05-04Paper
Graphs with two crossings are 5-choosable
SIAM Journal on Discrete Mathematics
2012-03-15Paper
Choosability of planar graphs of girth 52011-09-13Paper
3-choosability of triangle-free planar graphs with constraints on 4-cycles
SIAM Journal on Discrete Mathematics
2011-06-17Paper
Randić index and the diameter of a graph
European Journal of Combinatorics
2011-03-04Paper
On recognizing graphs by numbers of homomorphisms
Journal of Graph Theory
2010-11-24Paper
Spectral radius of finite and infinite planar graphs and of graphs of bounded genus
Journal of Combinatorial Theory. Series B
2010-11-05Paper
Crossing-critical graphs with large maximum degree
Journal of Combinatorial Theory. Series B
2010-06-03Paper
Distance constrained labelings of planar graphs with no short cycles
Discrete Applied Mathematics
2010-04-28Paper
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
Journal of Graph Theory
2010-04-22Paper
Small graph classes and bounded expansion
Journal of Combinatorial Theory. Series B
2010-04-21Paper
Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs
Discrete Mathematics
2010-03-29Paper
On a Rado type problem for homogeneous second order linear recurrences
The Electronic Journal of Combinatorics
2010-03-26Paper
On a Rado type problem for homogeneous second order linear recurrences
The Electronic Journal of Combinatorics
2010-03-26Paper
Pattern hypergraphs
The Electronic Journal of Combinatorics
2010-03-26Paper
Matchings and nonrainbow colorings
SIAM Journal on Discrete Mathematics
2010-03-17Paper
\(k\)-chromatic number of graphs on surfaces
SIAM Journal on Discrete Mathematics
2010-03-17Paper
Algorithms for classes of graphs with bounded expansion
Graph-Theoretic Concepts in Computer Science
2010-01-21Paper
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
Discrete Mathematics
2009-12-15Paper
A note on antisymmetric flows in graphs
European Journal of Combinatorics
2009-12-01Paper
Graph Drawing
Lecture Notes in Computer Science
2009-08-11Paper
Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph
SIAM Journal on Discrete Mathematics
2009-05-27Paper
List-Coloring Squares of Sparse Subcubic Graphs
SIAM Journal on Discrete Mathematics
2009-03-16Paper
Two-factors in orientated graphs with forbidden transitions
Discrete Mathematics
2009-01-28Paper
On forbidden subdivision characterizations of graph classes
European Journal of Combinatorics
2008-05-29Paper
Coloring Triangle-Free Graphs on Surfaces
Algorithms and Computation
2008-05-27Paper
Coloring squares of planar graphs with girth six
European Journal of Combinatorics
2008-05-13Paper
Graph covering via shortest paths2008-02-20Paper
Noncrossing Hamiltonian paths in geometric graphs
Discrete Applied Mathematics
2007-06-08Paper
Four gravity results
Discrete Mathematics
2007-02-13Paper
Probabilistic strategies for the partition and plurality problems
Random Structures & Algorithms
2007-02-07Paper
Eulerian colorings and the bipartizing matchings conjecture of Fleischner
European Journal of Combinatorics
2006-11-15Paper
Algorithms and Computation
Lecture Notes in Computer Science
2006-11-14Paper
A Theorem About a Contractible and Light Edge
SIAM Journal on Discrete Mathematics
2006-06-01Paper
Locally consistent constraint satisfaction problems
Theoretical Computer Science
2006-01-09Paper
STACS 2005
Lecture Notes in Computer Science
2005-12-02Paper
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science
2005-09-07Paper
Automata, Languages and Programming
Lecture Notes in Computer Science
2005-08-24Paper
Coloring face hypergraphs on surfaces
European Journal of Combinatorics
2005-01-11Paper
scientific article; zbMATH DE number 1953091 (Why is no real title available?)2003-07-25Paper
On planar mixed hypergraphs
The Electronic Journal of Combinatorics
2001-12-11Paper
Sparsity of 3-flow critical graphs
(available as arXiv preprint)
N/APaper


Research outcomes over time


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