On Planar Mixed Hypergraphs. - Zdenek Dvorák 001; Daniel Král (Electron. J. Comb., 2001)

Complexity of Pattern Coloring of Cycle Systems. - Zdenek Dvorák 001; Jan Kára; Daniel Král; Ondrej Pangrác (WG, 2002)

Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). - Zdenek Dvorák 001; Daniel Král; Ondrej Pangrác (ICALP, 2004)

An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. - Zdenek Dvorák 001; Jan Kára; Daniel Král; Ondrej Pangrác (SWAT, 2004)

On the Complexity of the G-Reconstruction Problem. - Zdenek Dvorák 001; Vít Jelínek (ISAAC, 2005)

Three Optimal Algorithms for Balls of Three Colors. - Zdenek Dvorák 001; Vít Jelínek; Daniel Král; Jan Kyncl; Michael E. Saks (STACS, 2005)

Coloring face hypergraphs on surfaces. - Zdenek Dvorák 001; Daniel Král; Riste Skrekovski (Eur. J. Comb., 2005)

Locally consistent constraint satisfaction problems. - Zdenek Dvorák 001; Daniel Král; Ondrej Pangrác (Theor. Comput. Sci., 2005)

Eulerian colorings and the bipartizing matchings conjecture of Fleischner. - Zdenek Dvorák 001; Tomás Kaiser; Daniel Král (Eur. J. Comb., 2006)

A Theorem About a Contractible and Light Edge. - Zdenek Dvorák 001; Riste Skrekovski (SIAM J. Discret. Math., 2006)

Noncrossing Hamiltonian paths in geometric graphs. - Jakub Cerný; Zdenek Dvorák 001; Vít Jelínek; Jan Kára (Discret. Appl. Math., 2007)

Four gravity results. - Zdenek Dvorák 001; Riste Skrekovski; Tomás Valla (Discret. Math., 2007)

Probabilistic strategies for the partition and plurality problems. - Zdenek Dvorák 001; Vít Jelínek; Daniel Král; Jan Kyncl; Michael E. Saks (Random Struct. Algorithms, 2007)

On forbidden subdivision characterizations of graph classes. - Zdenek Dvorák 001 (Eur. J. Comb., 2008)

Coloring squares of planar graphs with girth six. - Zdenek Dvorák 001; Daniel Král; Pavel Nejedlý; Riste Skrekovski (Eur. J. Comb., 2008)

List-Coloring Squares of Sparse Subcubic Graphs. - Zdenek Dvorák 001; Riste Skrekovski; Martin Tancer (SIAM J. Discret. Math., 2008)

Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph. - Zdenek Dvorák 001; Riste Skrekovski; Tomás Valla (SIAM J. Discret. Math., 2008)

Coloring triangle-free graphs on surfaces. - Zdenek Dvorák 001; Daniel Král; Robin Thomas 001 (SODA, 2009)

Algorithms for Classes of Graphs with Bounded Expansion. - Zdenek Dvorák 001; Daniel Král (WG, 2009)

Distance constrained labelings of planar graphs with no short cycles. - Zdenek Dvorák 001; Daniel Král; Pavel Nejedlý; Riste Skrekovski (Discret. Appl. Math., 2009)

Two-factors in orientated graphs with forbidden transitions. - Zdenek Dvorák 001 (Discret. Math., 2009)

Planar graphs without 3-, 7-, and 8-cycles are 3-choosable. - Zdenek Dvorák 001; Bernard Lidický; Riste Skrekovski (Discret. Math., 2009)

Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract). - Zdenek Dvorák 001; Bojan Mohar (Electron. Notes Discret. Math., 2009)

Matchings and Nonrainbow Colorings. - Zdenek Dvorák 001; Stanislav Jendrol'; Daniel Král; Gyula Pap (SIAM J. Discret. Math., 2009)

k-Chromatic Number of Graphs on Surfaces. - Zdenek Dvorák 001; Riste Skrekovski (SIAM J. Discret. Math., 2009)

Deciding First-Order Properties for Sparse Graphs. - Zdenek Dvorák 001; Daniel Král; Robin Thomas 001 (FOCS, 2010)

On a Rado Type Problem for Homogeneous Second Order Linear Recurrences. - Hayri Ardal; Zdenek Dvorák 001; Veselin Jungic; Tomás Kaiser (Electron. J. Comb., 2010)

Pattern Hypergraphs. - Zdenek Dvorák 001; Jan Kára; Daniel Král'; Ondrej Pangrác (Electron. J. Comb., 2010)

Toughness threshold for the existence of 2-walks in K4-minor-free graphs. - Zdenek Dvorák 001; Daniel Král'; Jakub Teska (Discret. Math., 2010)

A note on antisymmetric flows in graphs. - Zdenek Dvorák 001; Tomás Kaiser; Daniel Král'; Jean-Sébastien Sereni (Eur. J. Comb., 2010)

Crossing-critical graphs with large maximum degree. - Zdenek Dvorák 001; Bojan Mohar (J. Comb. Theory B, 2010)

Spectral radius of finite and infinite planar graphs and of graphs of bounded genus. - Zdenek Dvorák 001; Bojan Mohar (J. Comb. Theory B, 2010)

Small graph classes and bounded expansion. - Zdenek Dvorák 001; Serguei Norine (J. Comb. Theory B, 2010)

On recognizing graphs by numbers of homomorphisms. - Zdenek Dvorák 001 (J. Graph Theory, 2010)

Non-rainbow colorings of 3-, 4- and 5-connected plane graphs. - Zdenek Dvorák 001; Daniel Král'; Riste Skrekovski (J. Graph Theory, 2010)

3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles. - Zdenek Dvorák 001; Bernard Lidický; Riste Skrekovski (SIAM J. Discret. Math., 2010)

Randić index and the diameter of a graph. - Zdenek Dvorák 001; Bernard Lidický; Riste Skrekovski (Eur. J. Comb., 2011)

Graphs with Two Crossings Are 5-Choosable. - Zdenek Dvorák 001; Bernard Lidický; Riste Skrekovski (SIAM J. Discret. Math., 2011)

Three-coloring triangle-free planar graphs in linear time. - Zdenek Dvorák 001; Ken-ichi Kawarabayashi; Robin Thomas 001 (ACM Trans. Algorithms, 2011)

A stronger structure theorem for excluded topological minors - Zdenek Dvorák 001 (CoRR, 2012)

Forbidden graphs for tree-depth. - Zdenek Dvorák 001; Archontia C. Giannopoulou; Dimitrios M. Thilikos (Eur. J. Comb., 2012)

Classes of graphs with small rank decompositions are X-bounded. - Zdenek Dvorák 001; Daniel Král' (Eur. J. Comb., 2012)

Bipartizing fullerenes. - Zdenek Dvorák 001; Bernard Lidický; Riste Skrekovski (Eur. J. Comb., 2012)

Spectrally degenerate graphs: Hereditary case. - Zdenek Dvorák 001; Bojan Mohar (J. Comb. Theory B, 2012)

List-coloring embedded graphs. - Zdenek Dvorák 001; Ken-ichi Kawarabayashi (SODA, 2013)

A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs. - Zdenek Dvorák 001; Vojtech Tuma (WADS, 2013)

Chromatic number and complete graph substructures for degree sequences. - Zdenek Dvorák 001; Bojan Mohar (Comb., 2013)

Dynamic Data Structure for Tree-Depth Decomposition. - Zdenek Dvorák 001; Martin Kupec; Vojtech Tuma (CoRR, 2013)

4-critical graphs on surfaces without contractible (<=4)-cycles - Zdenek Dvorák 001; Bernard Lidický (CoRR, 2013)

Constant-factor approximation of the domination number in sparse graphs. - Zdenek Dvorák 001 (Eur. J. Comb., 2013)

Testing first-order properties for subclasses of sparse graphs. - Zdenek Dvorák 001; Daniel Král; Robin Thomas 001 (J. ACM, 2013)

Sub-exponentially many 3-colorings of triangle-free planar graphs. - Arash Asadi; Zdenek Dvorák 001; Luke Postle; Robin Thomas 001 (J. Comb. Theory B, 2013)

Star Chromatic Index. - Zdenek Dvorák 001; Bojan Mohar; Robert Sámal (J. Graph Theory, 2013)

A Dynamic Data Structure for MSO Properties in Graphs with Bounded Tree-Depth. - Zdenek Dvorák 001; Martin Kupec; Vojtech Tuma (ESA, 2014)

A minimum degree condition forcing complete graph immersion. - Matt DeVos; Zdenek Dvorák 001; Jacob Fox; Jessica McDonald; Bojan Mohar; Diego Scheide (Comb., 2014)

List-coloring apex-minor-free graphs. - Zdenek Dvorák 001; Robin Thomas 001 (CoRR, 2014)

Planar 4-critical graphs with four triangles. - Oleg V. Borodin; Zdenek Dvorák 001; Alexandr V. Kostochka; Bernard Lidický; Matthew P. Yancey (Eur. J. Comb., 2014)

Distance-two coloring of sparse graphs. - Zdenek Dvorák 001; Louis Esperet (Eur. J. Comb., 2014)

3-choosability of planar graphs with ( 4)-cycles far apart. - Zdenek Dvorák 001 (J. Comb. Theory B, 2014)

Subcubic triangle-free graphs have fractional chromatic number at most 14/5. - Zdenek Dvorák 001; Jean-Sébastien Sereni; Jan Volec (J. Lond. Math. Soc., 2014)

Strong Immersions and Maximum Degree. - Zdenek Dvorák 001; Tereza Klimosová (SIAM J. Discret. Math., 2014)

4-Critical Graphs on Surfaces Without Contractible $( le !4)$-Cycles. - Zdenek Dvorák 001; Bernard Lidický (SIAM J. Discret. Math., 2014)

On Planar Boolean CSP. - Zdenek Dvorák 001; Martin Kupec (ICALP (1), 2015)

Fractional Coloring of Triangle-Free Planar Graphs. - Zdenek Dvorák 001; Jean-Sébastien Sereni; Jan Volec (Electron. J. Comb., 2015)

3-Coloring Triangle-Free Planar Graphs with a Precolored 8-Cycle. - Zdenek Dvorák 001; Bernard Lidický (J. Graph Theory, 2015)

Sublinear separators, fragility and subexponential expansion. - Zdenek Dvorák 001 (Eur. J. Comb., 2016)

Immersion in four-edge-connected graphs. - Maria Chudnovsky; Zdenek Dvorák 001; Tereza Klimosová; Paul D. Seymour (J. Comb. Theory B, 2016)

Packing six T-joins in plane graphs. - Zdenek Dvorák 001; Ken-ichi Kawarabayashi; Daniel Král' (J. Comb. Theory B, 2016)

Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2016)

Crossing Numbers of Periodic Graphs. - Zdenek Dvorák 001; Bojan Mohar (J. Graph Theory, 2016)

A Structure Theorem for Strong Immersions. - Zdenek Dvorák 001; Paul Wollan (J. Graph Theory, 2016)

Strongly Sublinear Separators and Polynomial Expansion. - Zdenek Dvorák 001; Sergey Norin (SIAM J. Discret. Math., 2016)

Graphic TSP in Cubic Graphs. - Zdenek Dvorák 001; Daniel Král; Bojan Mohar (STACS, 2017)

Independent Sets near the Lower Bound in Bounded Degree Graphs. - Zdenek Dvorák 001; Bernard Lidický (STACS, 2017)

Density of 5/2-critical graphs. - Zdenek Dvorák 001; Luke Postle (Comb., 2017)

Do Triangle-Free Planar Graphs have Exponentially Many $3$-Colorings? - Zdenek Dvorák 001; Jean-Sébastien Sereni (Electron. J. Comb., 2017)

Triangle-free graphs of tree-width t are ⌈ (t+3)/2 ⌉-colorable. - Zdenek Dvorák 001; Ken-ichi Kawarabayashi (Eur. J. Comb., 2017)

Exponentially many nowhere-zero ℝ3-, ℝ4-, and ℝ6-flows. - Zdenek Dvorák 001; Bojan Mohar; Robert Sámal (Electron. Notes Discret. Math., 2017)

Irreducible 4-critical triangle-free toroidal graphs. - Zdenek Dvorák 001; Jakub Pekárek (Electron. Notes Discret. Math., 2017)

5-choosability of graphs with crossings far apart. - Zdenek Dvorák 001; Bernard Lidický; Bojan Mohar (J. Comb. Theory B, 2017)

5-list-coloring planar graphs with distant precolored vertices. - Zdenek Dvorák 001; Bernard Lidický; Bojan Mohar; Luke Postle (J. Comb. Theory B, 2017)

Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles. - Zdenek Dvorák 001; Bernard Lidický (SIAM J. Discret. Math., 2017)

Large Independent Sets in Triangle-Free Planar Graphs. - Zdenek Dvorák 001; Matthias Mnich (SIAM J. Discret. Math., 2017)

Structure and Generation of Crossing-Critical Graphs. - Zdenek Dvorák 001; Petr Hlinený; Bojan Mohar (SoCG, 2018)

Thin graph classes and polynomial-time approximation schemes. - Zdenek Dvorák 001 (SODA, 2018)

Treewidth of Grid Subsets. - Eli Berger; Zdenek Dvorák 001; Sergey Norin (Comb., 2018)

Induced 2-Degenerate Subgraphs of Triangle-Free Planar Graphs. - Zdenek Dvorák 001; Tom Kelly 001 (Electron. J. Comb., 2018)

Least conflict choosability. - Zdenek Dvorák 001; Louis Esperet; Ross J. Kang; Kenta Ozeki (CoRR, 2018)

Induced subdivisions and bounded expansion. - Zdenek Dvorák 001 (Eur. J. Comb., 2018)

On classes of graphs with strongly sublinear separators. - Zdenek Dvorák 001 (Eur. J. Comb., 2018)

Planar graphs have two-coloring number at most 8. - Zdenek Dvorák 001; Adam Kabela; Tomás Kaiser (J. Comb. Theory B, 2018)

Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2018)

Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8. - Zdenek Dvorák 001; Luke Postle (J. Comb. Theory B, 2018)

Complete graph immersions and minimum degree. - Zdenek Dvorák 001; Liana Yepremyan (J. Graph Theory, 2018)

Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces. - Zdenek Dvorák 001; Bernard Lidický (SIAM J. Discret. Math., 2018)

Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains. - Zdenek Dvorák 001; Bernard Lidický (SIAM J. Discret. Math., 2018)

Exponentially Many Nowhere-Zero ℤ3-, ℤ4-, and ℤ6-Flows. - Zdenek Dvorák 001; Bojan Mohar; Robert Sámal (Comb., 2019)

On Generalized Choice and Coloring Numbers. - Zdenek Dvorák 001; Jakub Pekárek; Jean-Sébastien Sereni (Electron. J. Comb., 2019)

Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12. - Drago Bokal; Zdenek Dvorák 001; Petr Hlinený; Jesús Leaños; Bojan Mohar; Tilo Wiedera (CoRR, 2019)

Planar graphs without cycles of length 4 or 5 are (11: 3)-colorable. - Zdenek Dvorák 001; Xiaolan Hu (Eur. J. Comb., 2019)

Triangle-free planar graphs with small independence number. - Zdenek Dvorák 001; Jordan Venters (Eur. J. Comb., 2019)

Treewidth of graphs with balanced separations. - Zdenek Dvorák 001; Sergey Norin (J. Comb. Theory B, 2019)

On distance r?dominating and 2r?independent sets in sparse graphs. - Zdenek Dvorák 001 (J. Graph Theory, 2019)

Triangle-free planar graphs with the smallest independence number. - Zdenek Dvorák 001; Tomás Masarík; Jan Musílek; Ondrej Pangrác (J. Graph Theory, 2019)

List coloring with requests. - Zdenek Dvorák 001; Sergey Norin; Luke Postle (J. Graph Theory, 2019)

Baker game and polynomial-time approximation schemes. - Zdenek Dvorák 001 (SODA, 2020)

1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio. - Zdenek Dvorák 001; Patrice Ossona de Mendez; Hehui Wu (Comb., 2020)

An Update on Reconfiguring $10$-Colorings of Planar Graphs. - Zdenek Dvorák 001; Carl Feghali (Electron. J. Comb., 2020)

On Fractional Fragility Rates of Graph Classes. - Zdenek Dvorák 001; Jean-Sébastien Sereni (Electron. J. Comb., 2020)

Notes on Graph Product Structure Theory. - Zdenek Dvorák 001; Tony Huynh; Gwenaël Joret; Chun-Hung Liu; David R. Wood (CoRR, 2020)

Three-coloring triangle-free graphs on surfaces III. Graphs of girth five. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2020)

Flexibility of planar graphs of girth at least six. - Zdenek Dvorák 001; Tomás Masarík; Jan Musílek; Ondrej Pangrác (J. Graph Theory, 2020)

Fractional Coloring of Planar Graphs of Girth Five. - Zdenek Dvorák 001; Xiaolan Hu (SIAM J. Discret. Math., 2020)

(3a: a)-List-Colorability of Embedded Graphs of Girth at Least Five. - Zdenek Dvorák 001; Xiaolan Hu (SIAM J. Discret. Math., 2020)

Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. - Zdenek Dvorák 001; Abhiruk Lahiri (ESA, 2021)

Approximation metatheorem for fractionally treewidth-fragile graphs. - Zdenek Dvorák 001 (CoRR, 2021)

A note on sublinear separators and expansion. - Zdenek Dvorák 001 (Eur. J. Comb., 2021)

A Thomassen-type method for planar graph recoloring. - Zdenek Dvorák 001; Carl Feghali (Eur. J. Comb., 2021)

Cyclic coloring of plane graphs with maximum face size 16 and 17. - Zdenek Dvorák 001; Michael Hebdige; Filip Hlásek; Daniel Král'; Jonathan A. Noel (Eur. J. Comb., 2021)

Bounding the number of cycles in a graph in terms of its degree sequence. - Zdenek Dvorák 001; Natasha Morrison; Jonathan A. Noel; Sergey Norin; Luke Postle (Eur. J. Comb., 2021)

Coloring near-quadrangulations of the cylinder and the torus. - Zdenek Dvorák 001; Jakub Pekárek (Eur. J. Comb., 2021)

Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2021)

Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2021)

Single-conflict colouring. - Zdenek Dvorák 001; Louis Esperet; Ross J. Kang; Kenta Ozeki (J. Graph Theory, 2021)

Flexibility of triangle-free planar graphs. - Zdenek Dvorák 001; Tomás Masarík; Jan Musílek; Ondrej Pangrác (J. Graph Theory, 2021)

Sublinear Separators in Intersection Graphs of Convex Shapes. - Zdenek Dvorák 001; Rose McCarty; Sergey Norin (SIAM J. Discret. Math., 2021)

On Comparable Box Dimension. - Zdenek Dvorák 001; Daniel Gonçalves 001; Abhiruk Lahiri; Jane Tan; Torsten Ueckerdt (SoCG, 2022)

Weak Coloring Numbers of Intersection Graphs. - Zdenek Dvorák 001; Jakub Pekárek; Torsten Ueckerdt; Yelena Yuditsky (SoCG, 2022)

Approximation Metatheorems for Classes with Bounded Expansion. - Zdenek Dvorák 001 (SWAT, 2022)

Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12. - Drago Bokal; Zdenek Dvorák 001; Petr Hlinený; Jesús Leaños; Bojan Mohar; Tilo Wiedera (Comb., 2022)

Square roots of nearly planar graphs. - Zdenek Dvorák 001; Benjamin R. Moore; Abhiruk Lahiri (CoRR, 2022)

Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2022)

Characterization of 4-critical triangle-free toroidal graphs. - Zdenek Dvorák 001; Jakub Pekárek (J. Comb. Theory B, 2022)

Triangle-free planar graphs with at most 64n0.731 3-colorings. - Zdenek Dvorák 001; Luke Postle (J. Comb. Theory B, 2022)

On weighted sublinear separators. - Zdenek Dvorák 001 (J. Graph Theory, 2022)

Coloring count cones of planar graphs. - Zdenek Dvorák 001; Bernard Lidický (J. Graph Theory, 2022)

On Decidability of Hyperbolicity. - Zdenek Dvorák 001; Luke Postle (Comb., 2022)

Representation of Short Distances in Structurally Sparse Graphs. - Zdenek Dvorák 001 (STACS, 2023)

Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor. - Zdenek Dvorák 001; Abhiruk Lahiri (WG, 2023)

An efficient implementation and a strengthening of Alon-Tarsi list coloring method. - Zdenek Dvorák 001 (CoRR, 2023)

Embedded graph 3-coloring and flows. - Caroline Bang; Zdenek Dvorák 001; Emily Heath; Bernard Lidický (CoRR, 2023)

A note on local search for hitting sets. - Zdenek Dvorák 001 (CoRR, 2023)

Additive non-approximability of chromatic number in proper minor-closed classes. - Zdenek Dvorák 001; Ken-ichi Kawarabayashi (J. Comb. Theory B, 2023)

On Density of ( boldsymbol{ mathbb{Z}_3} ) -Flow-Critical Graphs. - Zdenek Dvorák 001; Bojan Mohar (SIAM J. Discret. Math., 2023)

Induced odd cycle packing number, independent sets, and chromatic number. - Zdenek Dvorák 001; Jakub Pekárek (J. Graph Theory, 2023)

A Strengthening and an Efficient Implementation of Alon-Tarsi List Coloring Method. - Zdenek Dvorák 001 (Electron. J. Comb., 2024)

Towards Characterization of 5-List-Colorability of Toroidal Graphs. - Zdenek Dvorák 001; Félix Moreno Peñarrubia (CoRR, 2024)

Weak diameter coloring of graphs on surfaces. - Zdenek Dvorák 001; Sergey Norin (Eur. J. Comb., 2024)

Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2024)

Solution to a Problem of Grünbaum on the Edge Density of 4-Critical Planar Graphs. - Zdenek Dvorák 001; Carl Feghali (Comb., 2024)

Precoloring extension in planar near-Eulerian-triangulations. - Zdenek Dvorák 001; Benjamin R. Moore; Michaela Seifrtová; Robert Sámal (Eur. J. Comb., 2025)

Asymptotic dimension of intersection graphs. - Zdenek Dvorák 001; Sergey Norin (Eur. J. Comb., 2025)

Sparsity of 3-flow-critical graphs. - Zdenek Dvorák 001; Sergey Norin (Eur. J. Comb., 2025)

Clustered coloring of (path + 2K1)-free graphs on surfaces. - Zdenek Dvorák 001 (J. Comb. Theory B, 2025)