Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDZdenek Dvorák
Person information
- affiliation: Charles University, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j106]Zdenek Dvorák
, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. J. Comb. Theory, Ser. B 152: 483-504 (2022)- [j105]Zdenek Dvorák, Jakub Pekárek:
Characterization of 4-critical triangle-free toroidal graphs. J. Comb. Theory, Ser. B 154: 336-369 (2022) - [j104]Zdenek Dvorák, Bernard Lidický:
Coloring count cones of planar graphs. J. Graph Theory 100(1): 84-100 (2022) - [j103]Zdenek Dvorák:
On weighted sublinear separators. J. Graph Theory 100(2): 270-280 (2022) - [c27]Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt:
On Comparable Box Dimension. SoCG 2022: 38:1-38:14 - [c26]Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky:
Weak Coloring Numbers of Intersection Graphs. SoCG 2022: 39:1-39:15 - [c25]Zdenek Dvorák:
Approximation Metatheorems for Classes with Bounded Expansion. SWAT 2022: 22:1-22:17 - [i50]Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt:
On Comparable Box Dimension. CoRR abs/2203.07686 (2022) - [i49]Zdenek Dvorák:
Representation of short distances in structurally sparse graphs. CoRR abs/2204.09113 (2022) - [i48]Zdenek Dvorák, Benjamin Moore, Abhiruk Lahari:
Square roots of nearly planar graphs. CoRR abs/2205.12764 (2022) - 2021
- [j102]Zdenek Dvorák, Natasha Morrison, Jonathan A. Noel, Sergey Norin, Luke Postle:
Bounding the number of cycles in a graph in terms of its degree sequence. Eur. J. Comb. 91: 103206 (2021) - [j101]Zdenek Dvorák, Jakub Pekárek:
Coloring near-quadrangulations of the cylinder and the torus. Eur. J. Comb. 93: 103258 (2021) - [j100]Zdenek Dvorák:
A note on sublinear separators and expansion. Eur. J. Comb. 93: 103273 (2021) - [j99]Zdenek Dvorák, Michael Hebdige, Filip Hlásek, Daniel Král', Jonathan A. Noel:
Cyclic coloring of plane graphs with maximum face size 16 and 17. Eur. J. Comb. 94: 103287 (2021) - [j98]Zdenek Dvorák, Carl Feghali:
A Thomassen-type method for planar graph recoloring. Eur. J. Comb. 95: 103319 (2021) - [j97]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies. J. Comb. Theory, Ser. B 150: 244-269 (2021) - [j96]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs. J. Comb. Theory, Ser. B 150: 270-304 (2021) - [j95]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Flexibility of triangle-free planar graphs. J. Graph Theory 96(4): 619-641 (2021) - [j94]Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki:
Single-conflict colouring. J. Graph Theory 97(1): 148-160 (2021) - [j93]Zdenek Dvorák, Rose McCarty, Sergey Norin:
Sublinear Separators in Intersection Graphs of Convex Shapes. SIAM J. Discret. Math. 35(2): 1149-1164 (2021) - [c24]Zdenek Dvorák, Abhiruk Lahiri:
Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. ESA 2021: 40:1-40:10 - [i47]Zdenek Dvorák:
Approximation metatheorem for fractionally treewidth-fragile graphs. CoRR abs/2103.08698 (2021) - [i46]Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky:
Weak Coloring Numbers of Intersection Graphs. CoRR abs/2103.17094 (2021) - [i45]Zdenek Dvorák, Abhiruk Lahiri:
Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs. CoRR abs/2105.01780 (2021) - 2020
- [j92]Zdenek Dvorák, Patrice Ossona de Mendez, Hehui Wu:
1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio. Comb. 40(6): 759-774 (2020) - [j91]Zdenek Dvorák, Carl Feghali:
An Update on Reconfiguring $10$-Colorings of Planar Graphs. Electron. J. Comb. 27(4): 4 (2020) - [j90]Zdenek Dvorák, Jean-Sébastien Sereni:
On Fractional Fragility Rates of Graph Classes. Electron. J. Comb. 27(4): 4 (2020) - [j89]Zdenek Dvorák, Jakub Pekárek:
Irreducible 4-critical triangle-free toroidal graphs. Eur. J. Comb. 88: 103112 (2020) - [j88]David Rehak, Simona Slivkova, Radim Pittner, Zdenek Dvorák:
Integral approach to assessing the criticality of railway infrastructure elements. Int. J. Crit. Infrastructures 16(2): 107-129 (2020) - [j87]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces III. Graphs of girth five. J. Comb. Theory, Ser. B 145: 376-432 (2020) - [j86]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Flexibility of planar graphs of girth at least six. J. Graph Theory 95(3): 457-466 (2020) - [j85]Zdenek Dvorák, Xiaolan Hu:
Fractional Coloring of Planar Graphs of Girth Five. SIAM J. Discret. Math. 34(1): 538-555 (2020) - [j84]Zdenek Dvorák, Xiaolan Hu:
(3a: a)-List-Colorability of Embedded Graphs of Girth at Least Five. SIAM J. Discret. Math. 34(4): 2137-2165 (2020) - [c23]Zdenek Dvorák:
Baker game and polynomial-time approximation schemes. SODA 2020: 2227-2240 - [i44]Zdenek Dvorák, Jakub Pekárek:
Induced odd cycle packing number, independent sets, and chromatic number. CoRR abs/2001.02411 (2020) - [i43]Zdenek Dvorák, Tony Huynh, Gwenaël Joret, Chun-Hung Liu, David R. Wood:
Notes on Graph Product Structure Theory. CoRR abs/2001.08860 (2020) - [i42]Zdenek Dvorák, Luke Postle:
On decidability of hyperbolicity. CoRR abs/2010.01634 (2020)
2010 – 2019
- 2019
- [j83]Zdenek Dvorák, Bojan Mohar, Robert Sámal:
Exponentially Many Nowhere-Zero ℤ3-, ℤ4-, and ℤ6-Flows. Comb. 39(6): 1237-1253 (2019) - [j82]Zdenek Dvorák, Jakub Pekárek, Jean-Sébastien Sereni:
On Generalized Choice and Coloring Numbers. Electron. J. Comb. 26(1): 1 (2019) - [j81]Zdenek Dvorák, Jordan Venters:
Triangle-free planar graphs with small independence number. Eur. J. Comb. 76: 88-103 (2019) - [j80]Zdenek Dvorák, Xiaolan Hu:
Planar graphs without cycles of length 4 or 5 are (11: 3)-colorable. Eur. J. Comb. 82 (2019) - [j79]Zdenek Dvorák, Sergey Norin:
Treewidth of graphs with balanced separations. J. Comb. Theory, Ser. B 137: 137-144 (2019) - [j78]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Triangle-free planar graphs with the smallest independence number. J. Graph Theory 90(3): 443-454 (2019) - [j77]Zdenek Dvorák:
On distance r?dominating and 2r?independent sets in sparse graphs. J. Graph Theory 91(2): 162-173 (2019) - [j76]Zdenek Dvorák, Sergey Norin, Luke Postle:
List coloring with requests. J. Graph Theory 92(3): 191-206 (2019) - [c22]Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera:
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. SoCG 2019: 14:1-14:15 - [i41]Zdenek Dvorák:
Baker game and polynomial-time approximation schemes. CoRR abs/1901.01797 (2019) - [i40]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Flexibility of triangle-free planar graphs. CoRR abs/1902.02971 (2019) - [i39]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Flexibility of planar graphs of girth at least six. CoRR abs/1902.04069 (2019) - [i38]Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera:
Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12. CoRR abs/1903.05363 (2019) - [i37]Zdenek Dvorák, Jakub Pekárek:
Coloring near-quadrangulations of the cylinder and the torus. CoRR abs/1909.12015 (2019) - 2018
- [j75]Eli Berger, Zdenek Dvorák, Sergey Norin:
Treewidth of Grid Subsets. Comb. 38(6): 1337-1352 (2018) - [j74]Zdenek Dvorák, Tom Kelly:
Induced 2-Degenerate Subgraphs of Triangle-Free Planar Graphs. Electron. J. Comb. 25(1): 1 (2018) - [j73]Zdenek Dvorák:
Induced subdivisions and bounded expansion. Eur. J. Comb. 69: 143-148 (2018) - [j72]Zdenek Dvorák:
On classes of graphs with strongly sublinear separators. Eur. J. Comb. 71: 1-11 (2018) - [j71]Zdenek Dvorák, Luke Postle:
Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8. J. Comb. Theory, Ser. B 129: 38-54 (2018) - [j70]Zdenek Dvorák, Adam Kabela, Tomás Kaiser:
Planar graphs have two-coloring number at most 8. J. Comb. Theory, Ser. B 130: 144-157 (2018) - [j69]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk. J. Comb. Theory, Ser. B 132: 1-46 (2018) - [j68]Zdenek Dvorák, Liana Yepremyan:
Complete graph immersions and minimum degree. J. Graph Theory 88(1): 211-221 (2018) - [j67]Zdenek Dvorák, Bernard Lidický:
Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces. SIAM J. Discret. Math. 32(1): 94-105 (2018) - [j66]Zdenek Dvorák, Bernard Lidický:
Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains. SIAM J. Discret. Math. 32(3): 1775-1805 (2018) - [c21]Zdenek Dvorák, Petr Hlinený, Bojan Mohar:
Structure and Generation of Crossing-Critical Graphs. SoCG 2018: 33:1-33:14 - [c20]Zdenek Dvorák, Ken-ichi Kawarabayashi:
Additive Non-Approximability of Chromatic Number in Proper Minor-Closed Classes. ICALP 2018: 47:1-47:12 - [c19]Zdenek Dvorák:
Thin graph classes and polynomial-time approximation schemes. SODA 2018: 1685-1701 - [i36]Zdenek Dvorák, Petr Hlinený, Bojan Mohar:
Structure and generation of crossing-critical graphs. CoRR abs/1803.01931 (2018) - [i35]Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki:
Least conflict choosability. CoRR abs/1803.10962 (2018) - 2017
- [j65]Zdenek Dvorák, Luke Postle:
Density of 5/2-critical graphs. Comb. 37(5): 863-886 (2017) - [j64]Zdenek Dvorák, Jean-Sébastien Sereni:
Do Triangle-Free Planar Graphs have Exponentially Many $3$-Colorings? Electron. J. Comb. 24(3): 3 (2017) - [j63]Zdenek Dvorák, Ken-ichi Kawarabayashi:
Triangle-free graphs of tree-width t are ⌈ (t+3)/2 ⌉-colorable. Eur. J. Comb. 66: 95-100 (2017) - [j62]Zdenek Dvorák, Bojan Mohar, Robert Sámal:
Exponentially many nowhere-zero ℝ3-, ℝ4-, and ℝ6-flows. Electron. Notes Discret. Math. 61: 375-381 (2017) - [j61]Zdenek Dvorák, Jakub Pekárek:
Irreducible 4-critical triangle-free toroidal graphs. Electron. Notes Discret. Math. 61: 383-389 (2017) - [j60]Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle:
5-list-coloring planar graphs with distant precolored vertices. J. Comb. Theory, Ser. B 122: 311-352 (2017) - [j59]Zdenek Dvorák, Bernard Lidický, Bojan Mohar:
5-choosability of graphs with crossings far apart. J. Comb. Theory, Ser. B 123: 54-96 (2017) - [j58]Zdenek Dvorák, Bernard Lidický:
Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles. SIAM J. Discret. Math. 31(2): 865-874 (2017) - [j57]Zdenek Dvorák, Matthias Mnich:
Large Independent Sets in Triangle-Free Planar Graphs. SIAM J. Discret. Math. 31(2): 1355-1373 (2017) - [c18]Zdenek Dvorák, Daniel Král, Bojan Mohar:
Graphic TSP in Cubic Graphs. STACS 2017: 27:1-27:13 - [c17]Zdenek Dvorák, Bernard Lidický:
Independent Sets near the Lower Bound in Bounded Degree Graphs. STACS 2017: 28:1-28:13 - [i34]Zdenek Dvorák, Jordan Venters:
Triangle-free planar graphs with small independence number. CoRR abs/1702.02888 (2017) - [i33]Zdenek Dvorák:
Thin graph classes and polynomial-time approximation schemes. CoRR abs/1704.00125 (2017) - [i32]Zdenek Dvorák, Ken-ichi Kawarabayashi:
Additive non-approximability of chromatic number in proper minor-closed classes. CoRR abs/1707.03888 (2017) - [i31]Zdenek Dvorák, Tom Kelly:
Induced 2-degenerate Subgraphs of Triangle-free Planar Graphs. CoRR abs/1709.04036 (2017) - [i30]Zdenek Dvorák:
On classes of graphs with strongly sublinear separators. CoRR abs/1710.03117 (2017) - [i29]Zdenek Dvorák:
On distance r-dominating and 2r-independent sets in sparse graphs. CoRR abs/1710.10010 (2017) - 2016
- [j56]Zdenek Dvorák:
Sublinear separators, fragility and subexponential expansion. Eur. J. Comb. 52: 103-119 (2016) - [j55]Maria Chudnovsky, Zdenek Dvorák, Tereza Klimosová, Paul D. Seymour:
Immersion in four-edge-connected graphs. J. Comb. Theory, Ser. B 116: 208-218 (2016) - [j54]Zdenek Dvorák, Ken-ichi Kawarabayashi, Daniel Král':
Packing six T-joins in plane graphs. J. Comb. Theory, Ser. B 116: 287-305 (2016) - [j53]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle. J. Comb. Theory, Ser. B 120: 1-17 (2016) - [j52]Zdenek Dvorák, Bojan Mohar:
Crossing Numbers of Periodic Graphs. J. Graph Theory 83(1): 34-43 (2016) - [j51]Zdenek Dvorák, Paul Wollan:
A Structure Theorem for Strong Immersions. J. Graph Theory 83(2): 152-163 (2016) - [j50]Zdenek Dvorák, Sergey Norin:
Strongly Sublinear Separators and Polynomial Expansion. SIAM J. Discret. Math. 30(2): 1095-1101 (2016) - [i28]Zdenek Dvorák, Daniel Král, Robin Thomas:
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. CoRR abs/1601.01197 (2016) - [i27]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Triangle-free planar graphs with the smallest independence number. CoRR abs/1606.06265 (2016) - [i26]Zdenek Dvorák, Daniel Král, Bojan Mohar:
Graphic TSP in cubic graphs. CoRR abs/1608.07568 (2016) - [i25]Zdenek Dvorák, Bernard Lidický:
Independent sets near the lower bound in bounded degree graphs. CoRR abs/1609.09134 (2016) - 2015
- [j49]Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec:
Fractional Coloring of Triangle-Free Planar Graphs. Electron. J. Comb. 22(4): 4 (2015) - [j48]Zdenek Dvorák, Bernard Lidický:
3-Coloring Triangle-Free Planar Graphs with a Precolored 8-Cycle. J. Graph Theory 80(2): 98-111 (2015) - [c16]Zdenek Dvorák, Martin Kupec:
On Planar Boolean CSP. ICALP (1) 2015: 432-443 - [i24]Zdenek Dvorák, Daniel Král, Robin Thomas:
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. CoRR abs/1509.01013 (2015) - 2014
- [j47]Matt DeVos, Zdenek Dvorák, Jacob Fox, Jessica McDonald, Bojan Mohar, Diego Scheide:
A minimum degree condition forcing complete graph immersion. Comb. 34(3): 279-298 (2014) - [j46]Zdenek Dvorák, Louis Esperet:
Distance-two coloring of sparse graphs. Eur. J. Comb. 36: 406-415 (2014) - [j45]Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey:
Planar 4-critical graphs with four triangles. Eur. J. Comb. 41: 138-151 (2014) - [j44]Zdenek Dvorák:
3-choosability of planar graphs with ( 4)-cycles far apart. J. Comb. Theory, Ser. B 104: 28-59 (2014) - [j43]Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec:
Subcubic triangle-free graphs have fractional chromatic number at most 14/5. J. Lond. Math. Soc. 89(3): 641-662 (2014) - [j42]Zdenek Dvorák, Tereza Klimosová:
Strong Immersions and Maximum Degree. SIAM J. Discret. Math. 28(1): 177-187 (2014) - [j41]Zdenek Dvorák, Bernard Lidický:
4-Critical Graphs on Surfaces Without Contractible $(\le\!4)$-Cycles. SIAM J. Discret. Math. 28(1): 521-552 (2014) - [c15]Zdenek Dvorák, Martin Kupec, Vojtech Tuma:
A Dynamic Data Structure for MSO Properties in Graphs with Bounded Tree-Depth. ESA 2014: 334-345 - [c14]Zdenek Dvorák, Matthias Mnich:
Large Independent Sets in Triangle-Free Planar Graphs. ESA 2014: 346-357 - [e1]Petr Hlinený, Zdenek Dvorák, Jirí Jaros, Jan Kofron, Jan Korenek, Petr Matula, Karel Pala:
Mathematical and Engineering Methods in Computer Science - 9th International Doctoral Workshop, MEMICS 2014, Telč, Czech Republic, October 17-19, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8934, Springer 2014, ISBN 978-3-319-14895-3 [contents] - [i23]Zdenek Dvorák, Robin Thomas:
List-coloring apex-minor-free graphs. CoRR abs/1401.1399 (2014) - [i22]Zdenek Dvorák:
Sublinear separators, fragility and subexponential expansion. CoRR abs/1404.7219 (2014) - [i21]Zdenek Dvorák, Sergey Norin:
Treewidth of graphs with balanced separations. CoRR abs/1408.3869 (2014) - 2013
- [j40]Zdenek Dvorák, Bojan Mohar:
Chromatic number and complete graph substructures for degree sequences. Comb. 33(5): 513-529 (2013) - [j39]Zdenek Dvorák:
Constant-factor approximation of the domination number in sparse graphs. Eur. J. Comb. 34(5): 833-840 (2013) - [j38]Zdenek Dvorák, Daniel Král, Robin Thomas:
Testing first-order properties for subclasses of sparse graphs. J. ACM 60(5): 36:1-36:24 (2013) - [j37]Arash Asadi, Zdenek Dvorák, Luke Postle, Robin Thomas:
Sub-exponentially many 3-colorings of triangle-free planar graphs. J. Comb. Theory, Ser. B 103(6): 706-712 (2013) - [j36]Zdenek Dvorák, Bojan Mohar, Robert Sámal:
Star Chromatic Index. J. Graph Theory 72(3): 313-326 (2013) - [c13]Zdenek Dvorák, Ken-ichi Kawarabayashi:
List-coloring embedded graphs. SODA 2013: 1004-1012 - [c12]Zdenek Dvorák, Vojtech Tuma:
A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs. WADS 2013: 304-315 - [i20]Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec:
Subcubic triangle-free graphs have fractional chromatic number at most 14/5. CoRR abs/1301.5296 (2013) - [i19]Zdenek Dvorák, Daniel Král, Robin Thomas:
Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk. CoRR abs/1302.2158 (2013) - [i18]Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas:
Three-coloring triangle-free planar graphs in linear time. CoRR abs/1302.5121 (2013) - [i17]Zdenek Dvorák, Tereza Klimosová:
Strong immersions and maximum degree. CoRR abs/1304.0728 (2013) - [i16]Zdenek Dvorák, Bernard Lidický:
3-coloring triangle-free planar graphs with a precolored 8-cycle. CoRR abs/1305.2467 (2013) - [i15]Zdenek Dvorák, Bernard Lidický:
4-critical graphs on surfaces without contractible (<=4)-cycles. CoRR abs/1305.2670 (2013) - [i14]Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey:
Planar 4-critical graphs with four triangles. CoRR abs/1306.1477 (2013)