Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. - Vít Jelínek; Eva Jelínková; Jan Kratochvíl; Bernard Lidický (GD, 2008)

Six-Critical Graphs on the Klein Bottle. - Nathan Chenette; Luke Postle; Noah Streib; Robin Thomas 001; Carl Yerger; Ken-ichi Kawarabayashi; Daniel Král; Jan Kyncl; Bernard Lidický (Electron. Notes Discret. Math., 2008)

On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles. - Bernard Lidický (Australas. J Comb., 2009)

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

The packing chromatic number of infinite product graphs. - Jirí Fiala 001; Sandi Klavzar; Bernard Lidický (Eur. J. Comb., 2009)

6-Critical Graphs on the Klein Bottle. - Ken-ichi Kawarabayashi; Daniel Král; Jan Kyncl; Bernard Lidický (SIAM J. Discret. Math., 2009)

Complexity of Locally Injective Homomorphism to the Theta Graphs. - Bernard Lidický; Marek Tesar 001 (IWOCA, 2010)

L(2, 1, 1)-Labeling Is NP-Complete for Trees. - Petr A. Golovach; Bernard Lidický; Daniël Paulusma (TAMC, 2010)

The packing chromatic number of the square lattice is at least 12 - Jan Ekstein; Jirí Fiala 001; Premysl Holub; Bernard Lidický (CoRR, 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)

Short Cycle Covers of Graphs with Minimum Degree Three. - Tomás Kaiser; Daniel Král'; Bernard Lidický; Pavel Nejedlý; Robert Sámal (SIAM J. Discret. Math., 2010)

Locally Injective Homomorphism to the Simple Weight Graphs. - Ondrej Bílka; Bernard Lidický; Marek Tesar 001 (TAMC, 2011)

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)

5-Coloring Graphs with 4 Crossings. - Rok Erman; Frédéric Havet; Bernard Lidický; Ondrej Pangrác (SIAM J. Discret. Math., 2011)

Finding vertex-surjective graph homomorphisms. - Petr A. Golovach; Bernard Lidický; Barnaby Martin; Daniël Paulusma (Acta Informatica, 2012)

The k-in-a-Path Problem for Claw-free Graphs. - Jirí Fiala 001; Marcin Kaminski 001; Bernard Lidický; Daniël Paulusma (Algorithmica, 2012)

Packing chromatic number of distance graphs. - Jan Ekstein; Premysl Holub; Bernard Lidický (Discret. Appl. Math., 2012)

Distance three labelings of trees. - Jirí Fiala 001; Petr A. Golovach; Jan Kratochvíl; Bernard Lidický; Daniël Paulusma (Discret. Appl. Math., 2012)

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

On the Turán Number of Forests. - Hong Liu 010; Bernard Lidický; Cory Palmer (Electron. J. Comb., 2013)

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

The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. - Vít Jelínek; Eva Jelínková; Jan Kratochvíl; Bernard Lidický; Marek Tesar 001; Tomás Vyskocil (Graphs Comb., 2013)

Peeling the Grid. - Sariel Har-Peled; Bernard Lidický (SIAM J. Discret. Math., 2013)

Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube. - József Balogh; Ping Hu 004; Bernard Lidický; Hong Liu 010 (Eur. J. Comb., 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)

Short proofs of coloring theorems on planar graphs. - Oleg V. Borodin; Alexandr V. Kostochka; Bernard Lidický; Matthew P. Yancey (Eur. J. Comb., 2014)

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

Minimum Number of Monotone Subsequences of Length 4 in Permutations. - József Balogh; Ping Hu 004; Bernard Lidický; Oleg Pikhurko; Balázs Udvari; Jan Volec (Comb. Probab. Comput., 2015)

On choosability with separation of planar graphs with lists of different sizes. - Hal A. Kierstead; Bernard Lidický (Discret. Math., 2015)

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

Rainbow copies of C4 in edge-colored hypercubes. - József Balogh; Michelle Delcourt; Bernard Lidický; Cory Palmer (Discret. Appl. Math., 2016)

Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle. - József Balogh; Ping Hu 004; Bernard Lidický; Florian Pfender (Eur. J. Comb., 2016)

On Choosability with Separation of Planar Graphs with Forbidden Cycles. - Ilkyoo Choi; Bernard Lidický; Derrick Stolee (J. Graph Theory, 2016)

On the tree search problem with non-uniform costs. - Ferdinando Cicalese; Balázs Keszegh; Bernard Lidický; Dömötör Pálvölgyi; Tomás Valla (Theor. Comput. Sci., 2016)

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

Injective choosability of subcubic planar graphs with girth 6. - Boris Brimkov; Jennifer Edmond; Robert Lazar; Bernard Lidický; Kacy Messerschmidt; Shanise Walker (Discret. Math., 2017)

Irreversible 2-conversion set in graphs of bounded degree. - Jan Kyncl; Bernard Lidický; Tomás Vyskocil (Discret. Math. Theor. Comput. Sci., 2017)

(4, 2)-Choosability of Planar Graphs with Forbidden Structures. - Zhanar Berikkyzy; Christopher Cox; Michael Dairyko; Kirsten Hogenson; Mohit Kumbhat; Bernard Lidický; Kacy Messerschmidt; Kevin Moss; Kathleen Nowak; Kevin F. Palmowski; Derrick Stolee (Graphs Comb., 2017)

Rainbow triangles in three-colored graphs. - József Balogh; Ping Hu 004; Bernard Lidický; Florian Pfender; Jan Volec; Michael Young (J. Comb. Theory B, 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)

On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs. - Ellen Gethner; Leslie Hogben; Bernard Lidický; Florian Pfender; Amanda Ruiz; Michael Young (J. Graph Theory, 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)

On the Strong Chromatic Index of Sparse Graphs. - Philip DeOrsey; Michael Ferrara; Nathan Graber; Stephen G. Hartke; Luke L. Nelsen; Eric Sullivan; Sogol Jahanbekam; Bernard Lidický; Derrick Stolee; Jennifer White (Electron. J. Comb., 2018)

On facial unique-maximum (edge-)coloring. - Vesna Andova; Bernard Lidický; Borut Luzar; Riste Skrekovski (Discret. Appl. Math., 2018)

A counterexample to a conjecture on facial unique-maximal colorings. - Bernard Lidický; Kacy Messerschmidt; Riste Skrekovski (Discret. Appl. Math., 2018)

3-coloring triangle-free planar graphs with a precolored 9-cycle. - Ilkyoo Choi; Jan Ekstein; Premysl Holub; Bernard Lidický (Eur. J. Comb., 2018)

Pentagons in triangle-free graphs. - Bernard Lidický; Florian Pfender (Eur. J. Comb., 2018)

Notes on complexity of packing coloring. - Minki Kim; Bernard Lidický; Tomás Masarík; Florian Pfender (Inf. Process. Lett., 2018)

Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles. - Maria Axenovich; John L. Goldwasser; Ryan Hansen; Bernard Lidický; Ryan R. Martin; David Offner; John M. Talbot; Michael Young (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)

Decomposing Graphs into Edges and Triangles. - Daniel Král'; Bernard Lidický; Taísa L. Martins; Yanitsa Pehova (Comb. Probab. Comput., 2019)

Facial unique-maximum colorings of plane graphs with restriction on big vertices. - Bernard Lidický; Kacy Messerschmidt; Riste Skrekovski (Discret. Math., 2019)

Polychromatic Colorings on the Integers. - Maria Axenovich; John L. Goldwasser; Bernard Lidický; Ryan R. Martin; David Offner; John M. Talbot; Michael Young (Integers, 2019)

Partition problems in high dimensional boxes. - Matija Bucic; Bernard Lidický; Jason Long; Adam Zsolt Wagner (J. Comb. Theory A, 2019)

Closing in on Hill's Conjecture. - József Balogh; Bernard Lidický; Gelasio Salazar (SIAM J. Discret. Math., 2019)

Minimizing the number of 5-cycles in graphs with given edge-density. - Patrick Bennett; Andrzej Dudek; Bernard Lidický; Oleg Pikhurko (Comb. Probab. Comput., 2020)

Inducibility of directed paths. - Ilkyoo Choi; Bernard Lidický; Florian Pfender (Discret. Math., 2020)

Ore and Chvátal-type degree conditions for bootstrap percolation from small sets. - Michael Dairyko; Michael Ferrara; Bernard Lidický; Ryan R. Martin; Florian Pfender; Andrew J. Uzzell (J. Graph Theory, 2020)

Making Kr+1-free graphs r-partite. - József Balogh; Felix Christian Clemen; Mikhail Lavrov; Bernard Lidický; Florian Pfender (Comb. Probab. Comput., 2021)

Sharp bounds for decomposing graphs into edges and triangles. - Adam Blumenthal; Bernard Lidický; Yanitsa Pehova; Florian Pfender; Oleg Pikhurko; Jan Volec (Comb. Probab. Comput., 2021)

Maximizing five-cycles in Kr-free graphs. - Bernard Lidický; Kyle Murphy (Eur. J. Comb., 2021)

Semidefinite Programming and Ramsey Numbers. - Bernard Lidický; Florian Pfender (SIAM J. Discret. Math., 2021)

Hadamard Diagonalizable Graphs of Order at Most 36. - Jane Breen; Steve Butler; Melissa M. Fuentes; Bernard Lidický; Michael Phillips; Alexander Riasanovksy; Sung-Yell Song; Ralihe R. Villagrán; Cedar Wiseman; Xiaohong Zhang (Electron. J. Comb., 2022)

Planar Turán Numbers of Cycles: A Counterexample. - Daniel W. Cranston; Bernard Lidický; Xiaonan Liu; Abhinav Shantanam (Electron. J. Comb., 2022)

Maximum number of almost similar triangles in the plane. - József Balogh; Felix Christian Clemen; Bernard Lidický (Comput. Geom., 2022)

On tripartite common graphs. - Andrzej Grzesik; Joonkyung Lee; Bernard Lidický; Jan Volec (Comb. Probab. Comput., 2022)

On Weak Flexibility in Planar Graphs. - Bernard Lidický; Tomás Masarík; Kyle Murphy; Shira Zerbib (Graphs Comb., 2022)

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

Counterexamples to a Conjecture of Harris on Hall Ratio. - Adam Blumenthal; Bernard Lidický; Ryan R. Martin; Sergey Norin; Florian Pfender; Jan Volec (SIAM J. Discret. Math., 2022)

Crossing numbers of complete bipartite graphs. - József Balogh; Bernard Lidický; Sergey Norin; Florian Pfender; Gelasio Salazar; Sam Spiro (LAGOS, 2023)

Nearly All k-SAT Functions Are Unate. - József Balogh; Dingding Dong; Bernard Lidický; Nitya Mani; Yufei Zhao (STOC, 2023)

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

Shortened universal cycles for permutations. - Rachel Kirsch; Bernard Lidický; Clare Sibley; Elizabeth Sprangel (Discret. Appl. Math., 2023)

The Spectrum of Triangle-Free Graphs. - József Balogh; Felix Christian Clemen; Bernard Lidický; Sergey Norin; Jan Volec (SIAM J. Discret. Math., 2023)

C5 ${C}_{5}$ is almost a fractalizer. - Bernard Lidický; Connor Mattes; Florian Pfender (J. Graph Theory, 2023)

Proper Rainbow Saturation Numbers for Cycles. - Anastasia Halfpap; Bernard Lidický; Tomás Masarík (CoRR, 2024)

Relaxation of Wegner's planar graph conjecture for maximum degree 4. - Eun-Kyung Cho; Ilkyoo Choi; Bernard Lidický (Discret. Appl. Math., 2024)

10 problems for partitions of triangle-free graphs. - József Balogh; Felix Christian Clemen; Bernard Lidický (Eur. J. Comb., 2024)

Decomposing random regular graphs into stars. - Michelle Delcourt; Catherine S. Greenhill; Mikhail Isaev; Bernard Lidický; Luke Postle (Eur. J. Comb., 2025)

Triangle Percolation on the Grid. - Igor Araujo; Bryce Frederickson; Robert A. Krueger; Bernard Lidický; Tyrrell B. McAllister; Florian Pfender; Sam Spiro; Eric Nathan Stucky (Discret. Comput. Geom., 2025)