Zdenek Dvorák

205 papers A* 12A 8B 6Journal 175Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Asymptotic dimension of intersection graphs. Eur. J. Comb. Zdenek Dvorák, Sergey Norin
2025	J	`jnl`	Clustered coloring of (path + 2K1)-free graphs on surfaces. J. Comb. Theory B Zdenek Dvorák
2025	J	`jnl`	Precoloring extension in planar near-Eulerian-triangulations. Eur. J. Comb. Zdenek Dvorák, Benjamin R. Moore, Michaela Seifrtová, Robert Sámal
2025	J	`jnl`	Precoloring extension in planar near-Eulerian-triangulations. Eur. J. Comb. Zdenek Dvorák, Benjamin R. Moore, Michaela Seifrtová, Robert Sámal
2025	J	`jnl`	Sparsity of 3-flow-critical graphs. Eur. J. Comb. Zdenek Dvorák, Sergey Norin
2024	J	`jnl`	A Strengthening and an Efficient Implementation of Alon-Tarsi List Coloring Method. Electron. J. Comb. Zdenek Dvorák
2024	J	`jnl`	Solution to a Problem of Grünbaum on the Edge Density of 4-Critical Planar Graphs. Comb. Zdenek Dvorák, Carl Feghali
2024	J	`jnl`	Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. J. Comb. Theory B Zdenek Dvorák, Daniel Král', Robin Thomas
2024	J	`jnl`	Towards Characterization of 5-List-Colorability of Toroidal Graphs. CoRR Zdenek Dvorák, Félix Moreno Peñarrubia
2024	J	`jnl`	Weak diameter coloring of graphs on surfaces. Eur. J. Comb. Zdenek Dvorák, Sergey Norin
2023	J	`jnl`	A note on local search for hitting sets. CoRR Zdenek Dvorák
2023	J	`jnl`	Additive non-approximability of chromatic number in proper minor-closed classes. J. Comb. Theory B Zdenek Dvorák, Ken-ichi Kawarabayashi
2023	J	`jnl`	An efficient implementation and a strengthening of Alon-Tarsi list coloring method. CoRR Zdenek Dvorák
2023	J	`jnl`	Embedded graph 3-coloring and flows. CoRR Caroline Bang, Zdenek Dvorák, Emily Heath, Bernard Lidický
2023	J	`jnl`	Induced odd cycle packing number, independent sets, and chromatic number. J. Graph Theory Zdenek Dvorák, Jakub Pekárek
2023	B	`conf`	Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor. WG Zdenek Dvorák, Abhiruk Lahiri
2023	J	`jnl`	Maximum edge colouring problem on graphs that exclude a fixed minor. CoRR Zdenek Dvorák, Abhiruk Lahiri
2023	J	`jnl`	On Density of $\boldsymbol{\mathbb{Z}_3}$ -Flow-Critical Graphs. SIAM J. Discret. Math. Zdenek Dvorák, Bojan Mohar
2023	A	`conf`	Representation of Short Distances in Structurally Sparse Graphs. STACS Zdenek Dvorák
2022	—	`conf`	Approximation Metatheorems for Classes with Bounded Expansion. SWAT Zdenek Dvorák
2022	J	`jnl`	Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12. Comb. Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
2022	J	`jnl`	Characterization of 4-critical triangle-free toroidal graphs. J. Comb. Theory B Zdenek Dvorák, Jakub Pekárek
2022	J	`jnl`	Coloring count cones of planar graphs. J. Graph Theory Zdenek Dvorák, Bernard Lidický
2022	A*	`conf`	On Comparable Box Dimension. SoCG Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt
2022	J	`jnl`	On Comparable Box Dimension. CoRR Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt
2022	J	`jnl`	On Decidability of Hyperbolicity. Comb. Zdenek Dvorák, Luke Postle
2022	J	`jnl`	On weighted sublinear separators. J. Graph Theory Zdenek Dvorák
2022	J	`jnl`	Representation of short distances in structurally sparse graphs. CoRR Zdenek Dvorák
2022	J	`jnl`	Square roots of nearly planar graphs. CoRR Zdenek Dvorák, Benjamin R. Moore, Abhiruk Lahiri
2022	J	`jnl`	Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. J. Comb. Theory B Zdenek Dvorák, Daniel Král', Robin Thomas
2022	J	`jnl`	Triangle-free planar graphs with at most 64n0.731 3-colorings. J. Comb. Theory B Zdenek Dvorák, Luke Postle
2022	A*	`conf`	Weak Coloring Numbers of Intersection Graphs. SoCG Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky
2021	J	`jnl`	A Thomassen-type method for planar graph recoloring. Eur. J. Comb. Zdenek Dvorák, Carl Feghali
2021	J	`jnl`	A note on sublinear separators and expansion. Eur. J. Comb. Zdenek Dvorák
2021	A	`conf`	Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. ESA Zdenek Dvorák, Abhiruk Lahiri
2021	J	`jnl`	Approximation metatheorem for fractionally treewidth-fragile graphs. CoRR Zdenek Dvorák
2021	J	`jnl`	Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs. CoRR Zdenek Dvorák, Abhiruk Lahiri
2021	J	`jnl`	Bounding the number of cycles in a graph in terms of its degree sequence. Eur. J. Comb. Zdenek Dvorák, Natasha Morrison, Jonathan A. Noel, Sergey Norin, Luke Postle
2021	J	`jnl`	Coloring near-quadrangulations of the cylinder and the torus. Eur. J. Comb. Zdenek Dvorák, Jakub Pekárek
2021	J	`jnl`	Cyclic coloring of plane graphs with maximum face size 16 and 17. Eur. J. Comb. Zdenek Dvorák, Michael Hebdige, Filip Hlásek, Daniel Král', Jonathan A. Noel
2021	J	`jnl`	Flexibility of triangle-free planar graphs. J. Graph Theory Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2021	J	`jnl`	Single-conflict colouring. J. Graph Theory Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki
2021	J	`jnl`	Sublinear Separators in Intersection Graphs of Convex Shapes. SIAM J. Discret. Math. Zdenek Dvorák, Rose McCarty, Sergey Norin
2021	J	`jnl`	Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs. J. Comb. Theory B Zdenek Dvorák, Daniel Král', Robin Thomas
2021	J	`jnl`	Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies. J. Comb. Theory B Zdenek Dvorák, Daniel Král', Robin Thomas
2021	J	`jnl`	Weak Coloring Numbers of Intersection Graphs. CoRR Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky
2020	J	`jnl`	(3a: a)-List-Colorability of Embedded Graphs of Girth at Least Five. SIAM J. Discret. Math. Zdenek Dvorák, Xiaolan Hu
2020	J	`jnl`	1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio. Comb. Zdenek Dvorák, Patrice Ossona de Mendez, Hehui Wu
2020	J	`jnl`	An Update on Reconfiguring $10$-Colorings of Planar Graphs. Electron. J. Comb. Zdenek Dvorák, Carl Feghali
2020	A*	`conf`	Baker game and polynomial-time approximation schemes. SODA Zdenek Dvorák
2020	J	`jnl`	Flexibility of planar graphs of girth at least six. J. Graph Theory Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2020	J	`jnl`	Fractional Coloring of Planar Graphs of Girth Five. SIAM J. Discret. Math. Zdenek Dvorák, Xiaolan Hu
2020	J	`jnl`	Induced odd cycle packing number, independent sets, and chromatic number. CoRR Zdenek Dvorák, Jakub Pekárek
2020	J	`jnl`	Irreducible 4-critical triangle-free toroidal graphs. Eur. J. Comb. Zdenek Dvorák, Jakub Pekárek
2020	J	`jnl`	Notes on Graph Product Structure Theory. CoRR Zdenek Dvorák, Tony Huynh, Gwenaël Joret, Chun-Hung Liu, David R. Wood
2020	J	`jnl`	On Fractional Fragility Rates of Graph Classes. Electron. J. Comb. Zdenek Dvorák, Jean-Sébastien Sereni
2020	J	`jnl`	On decidability of hyperbolicity. CoRR Zdenek Dvorák, Luke Postle
2020	J	`jnl`	Three-coloring triangle-free graphs on surfaces III. Graphs of girth five. J. Comb. Theory B Zdenek Dvorák, Daniel Král', Robin Thomas
2019	J	`jnl`	Baker game and polynomial-time approximation schemes. CoRR Zdenek Dvorák
2019	A*	`conf`	Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. SoCG Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
2019	J	`jnl`	Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12. CoRR Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
2019	J	`jnl`	Coloring near-quadrangulations of the cylinder and the torus. CoRR Zdenek Dvorák, Jakub Pekárek
2019	J	`jnl`	Exponentially Many Nowhere-Zero ℤ Comb. Zdenek Dvorák, Bojan Mohar, Robert Sámal
2019	J	`jnl`	Flexibility of planar graphs of girth at least six. CoRR Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2019	J	`jnl`	Flexibility of triangle-free planar graphs. CoRR Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2019	J	`jnl`	List coloring with requests. J. Graph Theory Zdenek Dvorák, Sergey Norin, Luke Postle
2019	J	`jnl`	On Generalized Choice and Coloring Numbers. Electron. J. Comb. Zdenek Dvorák, Jakub Pekárek, Jean-Sébastien Sereni
2019	J	`jnl`	On distance r?dominating and 2r?independent sets in sparse graphs. J. Graph Theory Zdenek Dvorák
2019	J	`jnl`	Planar graphs without cycles of length 4 or 5 are (11: 3)-colorable. Eur. J. Comb. Zdenek Dvorák, Xiaolan Hu
2019	J	`jnl`	Treewidth of graphs with balanced separations. J. Comb. Theory B Zdenek Dvorák, Sergey Norin
2019	J	`jnl`	Triangle-free planar graphs with small independence number. Eur. J. Comb. Zdenek Dvorák, Jordan Venters
2019	J	`jnl`	Triangle-free planar graphs with the smallest independence number. J. Graph Theory Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2018	A*	`conf`	Additive Non-Approximability of Chromatic Number in Proper Minor-Closed Classes. ICALP Zdenek Dvorák, Ken-ichi Kawarabayashi
2018	J	`jnl`	Complete graph immersions and minimum degree. J. Graph Theory Zdenek Dvorák, Liana Yepremyan
2018	J	`jnl`	Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8. J. Comb. Theory B Zdenek Dvorák, Luke Postle
2018	J	`jnl`	Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains. SIAM J. Discret. Math. Zdenek Dvorák, Bernard Lidický
2018	J	`jnl`	Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces. SIAM J. Discret. Math. Zdenek Dvorák, Bernard Lidický
2018	J	`jnl`	Induced 2-Degenerate Subgraphs of Triangle-Free Planar Graphs. Electron. J. Comb. Zdenek Dvorák, Tom Kelly
2018	J	`jnl`	Induced subdivisions and bounded expansion. Eur. J. Comb. Zdenek Dvorák
2018	J	`jnl`	Least conflict choosability. CoRR Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki
2018	J	`jnl`	On classes of graphs with strongly sublinear separators. Eur. J. Comb. Zdenek Dvorák
2018	J	`jnl`	Planar graphs have two-coloring number at most 8. J. Comb. Theory B Zdenek Dvorák, Adam Kabela, Tomás Kaiser
2018	A*	`conf`	Structure and Generation of Crossing-Critical Graphs. SoCG Zdenek Dvorák, Petr Hlinený, Bojan Mohar
2018	J	`jnl`	Structure and generation of crossing-critical graphs. CoRR Zdenek Dvorák, Petr Hlinený, Bojan Mohar
2018	A*	`conf`	Thin graph classes and polynomial-time approximation schemes. SODA Zdenek Dvorák
2018	J	`jnl`	Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk. J. Comb. Theory B Zdenek Dvorák, Daniel Král', Robin Thomas
2018	J	`jnl`	Treewidth of Grid Subsets. Comb. Eli Berger, Zdenek Dvorák, Sergey Norin
2017	J	`jnl`	5-choosability of graphs with crossings far apart. J. Comb. Theory B Zdenek Dvorák, Bernard Lidický, Bojan Mohar
2017	J	`jnl`	5-list-coloring planar graphs with distant precolored vertices. J. Comb. Theory B Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle
2017	J	`jnl`	Additive non-approximability of chromatic number in proper minor-closed classes. CoRR Zdenek Dvorák, Ken-ichi Kawarabayashi
2017	J	`jnl`	Density of 5/2-critical graphs. Comb. Zdenek Dvorák, Luke Postle
2017	J	`jnl`	Do Triangle-Free Planar Graphs have Exponentially Many $3$-Colorings? Electron. J. Comb. Zdenek Dvorák, Jean-Sébastien Sereni
2017	J	`jnl`	Exponentially many nowhere-zero ℝ Electron. Notes Discret. Math. Zdenek Dvorák, Bojan Mohar, Robert Sámal
2017	J	`jnl`	Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles. SIAM J. Discret. Math. Zdenek Dvorák, Bernard Lidický
2017	A	`conf`	Graphic TSP in Cubic Graphs. STACS Zdenek Dvorák, Daniel Král, Bojan Mohar
2017	A	`conf`	Independent Sets near the Lower Bound in Bounded Degree Graphs. STACS Zdenek Dvorák, Bernard Lidický
2017	J	`jnl`	Induced 2-degenerate Subgraphs of Triangle-free Planar Graphs. CoRR Zdenek Dvorák, Tom Kelly
2017	J	`jnl`	Irreducible 4-critical triangle-free toroidal graphs. Electron. Notes Discret. Math. Zdenek Dvorák, Jakub Pekárek
2017	J	`jnl`	Large Independent Sets in Triangle-Free Planar Graphs. SIAM J. Discret. Math. Zdenek Dvorák, Matthias Mnich
2017	J	`jnl`	On classes of graphs with strongly sublinear separators. CoRR Zdenek Dvorák
2017	J	`jnl`	On distance r-dominating and 2r-independent sets in sparse graphs. CoRR Zdenek Dvorák
2017	J	`jnl`	Thin graph classes and polynomial-time approximation schemes. CoRR Zdenek Dvorák
2017	J	`jnl`	Triangle-free graphs of tree-width t are ⌈ (t+3)/2 ⌉-colorable. Eur. J. Comb. Zdenek Dvorák, Ken-ichi Kawarabayashi
2017	J	`jnl`	Triangle-free planar graphs with small independence number. CoRR Zdenek Dvorák, Jordan Venters
2016	J	`jnl`	A Structure Theorem for Strong Immersions. J. Graph Theory Zdenek Dvorák, Paul Wollan
2016	J	`jnl`	Crossing Numbers of Periodic Graphs. J. Graph Theory Zdenek Dvorák, Bojan Mohar
2016	J	`jnl`	Graphic TSP in cubic graphs. CoRR Zdenek Dvorák, Daniel Král, Bojan Mohar
2016	J	`jnl`	Immersion in four-edge-connected graphs. J. Comb. Theory B Maria Chudnovsky, Zdenek Dvorák, Tereza Klimosová, Paul D. Seymour
2016	J	`jnl`	Independent sets near the lower bound in bounded degree graphs. CoRR Zdenek Dvorák, Bernard Lidický
2016	J	`jnl`	Packing six T-joins in plane graphs. J. Comb. Theory B Zdenek Dvorák, Ken-ichi Kawarabayashi, Daniel Král'
2016	J	`jnl`	Strongly Sublinear Separators and Polynomial Expansion. SIAM J. Discret. Math. Zdenek Dvorák, Sergey Norin
2016	J	`jnl`	Sublinear separators, fragility and subexponential expansion. Eur. J. Comb. Zdenek Dvorák
2016	J	`jnl`	Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle. J. Comb. Theory B Zdenek Dvorák, Daniel Král', Robin Thomas
2016	J	`jnl`	Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. CoRR Zdenek Dvorák, Daniel Král, Robin Thomas
2016	J	`jnl`	Triangle-free planar graphs with the smallest independence number. CoRR Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2015	J	`jnl`	3-Coloring Triangle-Free Planar Graphs with a Precolored 8-Cycle. J. Graph Theory Zdenek Dvorák, Bernard Lidický
2015	J	`jnl`	Fractional Coloring of Triangle-Free Planar Graphs. Electron. J. Comb. Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec
2015	—	`conf`	On Planar Boolean CSP. ICALP (1) Zdenek Dvorák, Martin Kupec
2015	J	`jnl`	Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. CoRR Zdenek Dvorák, Daniel Král, Robin Thomas
2014	J	`jnl`	3-choosability of planar graphs with ( 4)-cycles far apart. J. Comb. Theory B Zdenek Dvorák
2014	J	`jnl`	4-Critical Graphs on Surfaces Without Contractible $(\le\!4)$-Cycles. SIAM J. Discret. Math. Zdenek Dvorák, Bernard Lidický
2014	A	`conf`	A Dynamic Data Structure for MSO Properties in Graphs with Bounded Tree-Depth. ESA Zdenek Dvorák, Martin Kupec, Vojtech Tuma
2014	J	`jnl`	A minimum degree condition forcing complete graph immersion. Comb. Matt DeVos, Zdenek Dvorák, Jacob Fox, Jessica McDonald, Bojan Mohar, Diego Scheide
2014	J	`jnl`	Distance-two coloring of sparse graphs. Eur. J. Comb. Zdenek Dvorák, Louis Esperet
2014	A	`conf`	Large Independent Sets in Triangle-Free Planar Graphs. ESA Zdenek Dvorák, Matthias Mnich
2014	J	`jnl`	List-coloring apex-minor-free graphs. CoRR Zdenek Dvorák, Robin Thomas
2014	—	`ed.`	Mathematical and Engineering Methods in Computer Science - 9th International Doctoral Workshop, MEMICS 2014, Telč, Czech Republic, October 17-19, 2014, Revised Selected Papers MEMICS Petr Hlinený, Zdenek Dvorák, Jirí Jaros, Jan Kofron, Jan Korenek, Petr Matula, Karel Pala
2014	J	`jnl`	Planar 4-critical graphs with four triangles. Eur. J. Comb. Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
2014	J	`jnl`	Strong Immersions and Maximum Degree. SIAM J. Discret. Math. Zdenek Dvorák, Tereza Klimosová
2014	J	`jnl`	Subcubic triangle-free graphs have fractional chromatic number at most 14/5. J. Lond. Math. Soc. Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec
2014	J	`jnl`	Sublinear separators, fragility and subexponential expansion. CoRR Zdenek Dvorák
2014	J	`jnl`	Treewidth of graphs with balanced separations. CoRR Zdenek Dvorák, Sergey Norin
2013	J	`jnl`	3-coloring triangle-free planar graphs with a precolored 8-cycle CoRR Zdenek Dvorák, Bernard Lidický
2013	J	`jnl`	4-critical graphs on surfaces without contractible (<=4)-cycles CoRR Zdenek Dvorák, Bernard Lidický
2013	B	`conf`	A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs. WADS Zdenek Dvorák, Vojtech Tuma
2013	J	`jnl`	Chromatic number and complete graph substructures for degree sequences. Comb. Zdenek Dvorák, Bojan Mohar
2013	J	`jnl`	Constant-factor approximation of the domination number in sparse graphs. Eur. J. Comb. Zdenek Dvorák
2013	J	`jnl`	Dynamic Data Structure for Tree-Depth Decomposition. CoRR Zdenek Dvorák, Martin Kupec, Vojtech Tuma
2013	J	`jnl`	Immersion in four-edge-connected graphs. CoRR Maria Chudnovsky, Zdenek Dvorák, Tereza Klimosová, Paul D. Seymour
2013	J	`jnl`	Large Independent Sets in Triangle-Free Planar Graphs. CoRR Zdenek Dvorák, Matthias Mnich
2013	A*	`conf`	List-coloring embedded graphs. SODA Zdenek Dvorák, Ken-ichi Kawarabayashi
2013	J	`jnl`	Planar 4-critical graphs with four triangles. CoRR Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
2013	J	`jnl`	Star Chromatic Index. J. Graph Theory Zdenek Dvorák, Bojan Mohar, Robert Sámal
2013	J	`jnl`	Strong immersions and maximum degree CoRR Zdenek Dvorák, Tereza Klimosová
2013	J	`jnl`	Sub-exponentially many 3-colorings of triangle-free planar graphs. J. Comb. Theory B Arash Asadi, Zdenek Dvorák, Luke Postle, Robin Thomas
2013	J	`jnl`	Subcubic triangle-free graphs have fractional chromatic number at most 14/5 CoRR Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec
2013	J	`jnl`	Testing first-order properties for subclasses of sparse graphs. J. ACM Zdenek Dvorák, Daniel Král, Robin Thomas
2013	J	`jnl`	Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk CoRR Zdenek Dvorák, Daniel Král, Robin Thomas
2013	J	`jnl`	Three-coloring triangle-free planar graphs in linear time CoRR Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas
2012	J	`jnl`	5-list-coloring planar graphs with distant precolored vertices CoRR Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle
2012	J	`jnl`	A dynamic data structure for counting subgraphs in sparse graphs CoRR Zdenek Dvorák, Vojtech Tuma
2012	J	`jnl`	A stronger structure theorem for excluded topological minors CoRR Zdenek Dvorák
2012	J	`jnl`	Bipartizing fullerenes. Eur. J. Comb. Zdenek Dvorák, Bernard Lidický, Riste Skrekovski
2012	J	`jnl`	Classes of graphs with small rank decompositions are X-bounded. Eur. J. Comb. Zdenek Dvorák, Daniel Král'
2012	J	`jnl`	Forbidden graphs for tree-depth. Eur. J. Comb. Zdenek Dvorák, Archontia C. Giannopoulou, Dimitrios M. Thilikos
2012	J	`jnl`	List-coloring embedded graphs CoRR Zdenek Dvorák, Ken-ichi Kawarabayashi
2012	J	`jnl`	Spectrally degenerate graphs: Hereditary case. J. Comb. Theory B Zdenek Dvorák, Bojan Mohar
2011	J	`jnl`	3-choosability of planar graphs with (<=4)-cycles far apart CoRR Zdenek Dvorák
2011	J	`jnl`	Constant-factor approximation of domination number in sparse graphs CoRR Zdenek Dvorák
2011	J	`jnl`	Graphs with Two Crossings Are 5-Choosable. SIAM J. Discret. Math. Zdenek Dvorák, Bernard Lidický, Riste Skrekovski
2011	J	`jnl`	Randić index and the diameter of a graph. Eur. J. Comb. Zdenek Dvorák, Bernard Lidický, Riste Skrekovski
2011	J	`jnl`	Testing first-order properties for subclasses of sparse graphs CoRR Zdenek Dvorák, Daniel Král, Robin Thomas
2011	J	`jnl`	Three-coloring triangle-free planar graphs in linear time. ACM Trans. Algorithms Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas
2010	J	`jnl`	3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles. SIAM J. Discret. Math. Zdenek Dvorák, Bernard Lidický, Riste Skrekovski
2010	J	`jnl`	A note on antisymmetric flows in graphs. Eur. J. Comb. Zdenek Dvorák, Tomás Kaiser, Daniel Král', Jean-Sébastien Sereni
2010	J	`jnl`	Crossing-critical graphs with large maximum degree. J. Comb. Theory B Zdenek Dvorák, Bojan Mohar
2010	A*	`conf`	Deciding First-Order Properties for Sparse Graphs. FOCS Zdenek Dvorák, Daniel Král, Robin Thomas
2010	J	`jnl`	Non-rainbow colorings of 3-, 4- and 5-connected plane graphs. J. Graph Theory Zdenek Dvorák, Daniel Král', Riste Skrekovski
2010	J	`jnl`	On a Rado Type Problem for Homogeneous Second Order Linear Recurrences. Electron. J. Comb. Hayri Ardal, Zdenek Dvorák, Veselin Jungic, Tomás Kaiser
2010	J	`jnl`	On recognizing graphs by numbers of homomorphisms. J. Graph Theory Zdenek Dvorák
2010	J	`jnl`	Pattern Hypergraphs. Electron. J. Comb. Zdenek Dvorák, Jan Kára, Daniel Král', Ondrej Pangrác
2010	J	`jnl`	Small graph classes and bounded expansion. J. Comb. Theory B Zdenek Dvorák, Serguei Norine
2010	J	`jnl`	Spectral radius of finite and infinite planar graphs and of graphs of bounded genus. J. Comb. Theory B Zdenek Dvorák, Bojan Mohar
2010	J	`jnl`	Spectrally degenerate graphs: Hereditary case CoRR Zdenek Dvorák, Bojan Mohar
2010	J	`jnl`	Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle CoRR Zdenek Dvorák, Daniel Král, Robin Thomas
2010	J	`jnl`	Toughness threshold for the existence of 2-walks in K Discret. Math. Zdenek Dvorák, Daniel Král', Jakub Teska
2009	B	`conf`	Algorithms for Classes of Graphs with Bounded Expansion. WG Zdenek Dvorák, Daniel Král
2009	A*	`conf`	Coloring triangle-free graphs on surfaces. SODA Zdenek Dvorák, Daniel Král, Robin Thomas
2009	J	`jnl`	Distance constrained labelings of planar graphs with no short cycles. Discret. Appl. Math. Zdenek Dvorák, Daniel Král, Pavel Nejedlý, Riste Skrekovski
2009	J	`jnl`	Matchings and Nonrainbow Colorings. SIAM J. Discret. Math. Zdenek Dvorák, Stanislav Jendrol', Daniel Král, Gyula Pap
2009	J	`jnl`	Planar graphs without 3-, 7-, and 8-cycles are 3-choosable. Discret. Math. Zdenek Dvorák, Bernard Lidický, Riste Skrekovski
2009	J	`jnl`	Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract). Electron. Notes Discret. Math. Zdenek Dvorák, Bojan Mohar
2009	A*	`conf`	Three-coloring triangle-free planar graphs in linear time. SODA Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas
2009	J	`jnl`	Two-factors in orientated graphs with forbidden transitions. Discret. Math. Zdenek Dvorák
2009	J	`jnl`	k-Chromatic Number of Graphs on Surfaces. SIAM J. Discret. Math. Zdenek Dvorák, Riste Skrekovski
2008	J	`jnl`	Coloring squares of planar graphs with girth six. Eur. J. Comb. Zdenek Dvorák, Daniel Král, Pavel Nejedlý, Riste Skrekovski
2008	J	`jnl`	List-Coloring Squares of Sparse Subcubic Graphs. SIAM J. Discret. Math. Zdenek Dvorák, Riste Skrekovski, Martin Tancer
2008	J	`jnl`	On forbidden subdivision characterizations of graph classes. Eur. J. Comb. Zdenek Dvorák
2008	J	`jnl`	Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph. SIAM J. Discret. Math. Zdenek Dvorák, Riste Skrekovski, Tomás Valla
2007	B	`conf`	Coloring Triangle-Free Graphs on Surfaces. ISAAC Zdenek Dvorák, Daniel Král, Robin Thomas
2007	J	`jnl`	Four gravity results. Discret. Math. Zdenek Dvorák, Riste Skrekovski, Tomás Valla
2007	J	`jnl`	Noncrossing Hamiltonian paths in geometric graphs. Discret. Appl. Math. Jakub Cerný, Zdenek Dvorák, Vít Jelínek, Jan Kára
2007	J	`jnl`	Probabilistic strategies for the partition and plurality problems. Random Struct. Algorithms Zdenek Dvorák, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks
2006	J	`jnl`	A Theorem About a Contractible and Light Edge. SIAM J. Discret. Math. Zdenek Dvorák, Riste Skrekovski
2006	J	`jnl`	Eulerian colorings and the bipartizing matchings conjecture of Fleischner. Eur. J. Comb. Zdenek Dvorák, Tomás Kaiser, Daniel Král
2005	J	`jnl`	Coloring face hypergraphs on surfaces. Eur. J. Comb. Zdenek Dvorák, Daniel Král, Riste Skrekovski
2005	J	`jnl`	Locally consistent constraint satisfaction problems. Theor. Comput. Sci. Zdenek Dvorák, Daniel Král, Ondrej Pangrác
2005	B	`conf`	On the Complexity of the ISAAC Zdenek Dvorák, Vít Jelínek
2005	A	`conf`	Three Optimal Algorithms for Balls of Three Colors. STACS Zdenek Dvorák, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks
2004	—	`conf`	An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. SWAT Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác
2004	A*	`conf`	Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). ICALP Zdenek Dvorák, Daniel Král, Ondrej Pangrác
2004	J	`jnl`	Locally consistent constraint satisfaction problems Electron. Colloquium Comput. Complex. Zdenek Dvorák, Daniel Král, Ondrej Pangrác
2003	A	`conf`	Noncrossing Hamiltonian Paths in Geometric Graphs. GD Jakub Cerný, Zdenek Dvorák, Vít Jelínek, Jan Kára
2002	B	`conf`	Complexity of Pattern Coloring of Cycle Systems. WG Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác
2001	J	`jnl`	On Planar Mixed Hypergraphs. Electron. J. Comb. Zdenek Dvorák, Daniel Král