Bernard Lidický

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 54

Top Venues

CoRR

SIAM J. Discret. Math.

Eur. J. Comb.

J. Graph Theory

Publications

Eun-Kyung Cho, Ilkyoo Choi, Bernard Lidický
Relaxation of Wegner's planar graph conjecture for maximum degree 4. Discret. Appl. Math. 358 (2024)
Anastasia Halfpap, Bernard Lidický, Tomás Masarík
Proper Rainbow Saturation Numbers for Cycles. CoRR (2024)
József Balogh, Felix Christian Clemen, Bernard Lidický
10 problems for partitions of triangle-free graphs. Eur. J. Comb. 121 (2024)
József Balogh, Bernard Lidický, Sergey Norin, Florian Pfender, Gelasio Salazar, Sam Spiro
Crossing numbers of complete bipartite graphs. LAGOS (2023)
Rachel Kirsch, Bernard Lidický, Clare Sibley, Elizabeth Sprangel
Shortened universal cycles for permutations. Discret. Appl. Math. 324 (2023)
Bernard Lidický, Connor Mattes, Florian Pfender
C5 ${C}_{5}$ is almost a fractalizer. J. Graph Theory 104 (1) (2023)
Caroline Bang, Zdenek Dvorák, Emily Heath, Bernard Lidický
Embedded graph 3-coloring and flows. CoRR (2023)
József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao
Nearly All k-SAT Functions Are Unate. STOC (2023)
József Balogh, Felix Christian Clemen, Bernard Lidický, Sergey Norin, Jan Volec
The Spectrum of Triangle-Free Graphs. SIAM J. Discret. Math. 37 (2) (2023)
Adam Blumenthal, Bernard Lidický, Ryan R. Martin, Sergey Norin, Florian Pfender, Jan Volec
Counterexamples to a Conjecture of Harris on Hall Ratio. SIAM J. Discret. Math. 36 (3) (2022)
József Balogh, Felix Christian Clemen, Bernard Lidický
Maximum number of almost similar triangles in the plane. Comput. Geom. (2022)
Daniel W. Cranston, Bernard Lidický, Xiaonan Liu, Abhinav Shantanam
Planar Turán Numbers of Cycles: A Counterexample. Electron. J. Comb. 29 (3) (2022)
Zdenek Dvorák, Bernard Lidický
Coloring count cones of planar graphs. J. Graph Theory 100 (1) (2022)
Andrzej Grzesik, Joonkyung Lee, Bernard Lidický, Jan Volec
On tripartite common graphs. Comb. Probab. Comput. 31 (5) (2022)
Bernard Lidický, Tomás Masarík, Kyle Murphy, Shira Zerbib
On Weak Flexibility in Planar Graphs. Graphs Comb. 38 (6) (2022)
Jane Breen, Steve Butler, Melissa Fuentes, Bernard Lidický, Michael Phillips, Alexander Riasanovksy, Sung-Yell Song, Ralihe R. Villagrán, Cedar Wiseman, Xiaohong Zhang
Hadamard Diagonalizable Graphs of Order at Most 36. Electron. J. Comb. 29 (2) (2022)
József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao
Nearly all k-SAT functions are unate. CoRR (2022)
Bernard Lidický, Kyle Murphy
Maximizing five-cycles in Kr-free graphs. Eur. J. Comb. 97 (2021)
Bernard Lidický, Florian Pfender
Semidefinite Programming and Ramsey Numbers. SIAM J. Discret. Math. 35 (4) (2021)
Adam Blumenthal, Bernard Lidický, Yanitsa Pehova, Florian Pfender, Oleg Pikhurko, Jan Volec
Sharp bounds for decomposing graphs into edges and triangles. Comb. Probab. Comput. 30 (2) (2021)
József Balogh, Felix Christian Clemen, Mikhail Lavrov, Bernard Lidický, Florian Pfender
Making Kr+1-free graphs r-partite. Comb. Probab. Comput. 30 (4) (2021)
Michael Dairyko, Michael Ferrara, Bernard Lidický, Ryan R. Martin, Florian Pfender, Andrew J. Uzzell
Ore and Chvátal-type degree conditions for bootstrap percolation from small sets. J. Graph Theory 94 (2) (2020)
Bernard Lidický, Tomás Masarík, Kyle Murphy, Shira Zerbib
On Weak Flexibility in Planar Graphs. CoRR (2020)
Patrick Bennett, Andrzej Dudek, Bernard Lidický, Oleg Pikhurko
Minimizing the number of 5-cycles in graphs with given edge-density. Comb. Probab. Comput. 29 (1) (2020)
Ilkyoo Choi, Bernard Lidický, Florian Pfender
Inducibility of directed paths. Discret. Math. 343 (10) (2020)
Matija Bucic, Bernard Lidický, Jason Long, Adam Zsolt Wagner
Partition problems in high dimensional boxes. J. Comb. Theory, Ser. A 166 (2019)
Daniel Král', Bernard Lidický, Taísa L. Martins, Yanitsa Pehova
Decomposing Graphs into Edges and Triangles. Comb. Probab. Comput. 28 (3) (2019)
Maria Axenovich, John L. Goldwasser, Bernard Lidický, Ryan R. Martin, David Offner, John M. Talbot, Michael Young
Polychromatic Colorings on the Integers. Integers 19 (2019)
József Balogh, Bernard Lidický, Gelasio Salazar
Closing in on Hill's Conjecture. SIAM J. Discret. Math. 33 (3) (2019)
Bernard Lidický, Kacy Messerschmidt, Riste Skrekovski
Facial unique-maximum colorings of plane graphs with restriction on big vertices. Discret. Math. 342 (9) (2019)
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) (2018)
Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender
Notes on complexity of packing coloring. Inf. Process. Lett. 137 (2018)
Vesna Andova, Bernard Lidický, Borut Luzar, Riste Skrekovski
On facial unique-maximum (edge-)coloring. Discret. Appl. Math. 237 (2018)
Zdenek Dvorák, Bernard Lidický
Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces. SIAM J. Discret. Math. 32 (1) (2018)
Bernard Lidický, Kacy Messerschmidt, Riste Skrekovski
A counterexample to a conjecture on facial unique-maximal colorings. Discret. Appl. Math. 237 (2018)
Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický
3-coloring triangle-free planar graphs with a precolored 9-cycle. Eur. J. Comb. 68 (2018)
Maria Axenovich, John L. Goldwasser, Ryan Hansen, Bernard Lidický, Ryan R. Martin, David Offner, John M. Talbot, Michael Young
Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles. J. Graph Theory 87 (4) (2018)
Philip DeOrsey, Michael Ferrara, Nathan Graber, Stephen G. Hartke, Luke L. Nelsen, Eric Sullivan, Sogol Jahanbekam, Bernard Lidický, Derrick Stolee, Jennifer White
On the Strong Chromatic Index of Sparse Graphs. Electron. J. Comb. 25 (3) (2018)
Bernard Lidický, Florian Pfender
Pentagons in triangle-free graphs. Eur. J. Comb. 74 (2018)
Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender
Notes on complexity of packing coloring. CoRR (2017)
Jan Kyncl, Bernard Lidický, Tomás Vyskocil
Irreversible 2-conversion set in graphs of bounded degree. Discret. Math. Theor. Comput. Sci. 19 (3) (2017)
Zdenek Dvorák, Bernard Lidický
Independent Sets near the Lower Bound in Bounded Degree Graphs. STACS (2017)
József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young
Rainbow triangles in three-colored graphs. J. Comb. Theory, Ser. B 126 (2017)
Ellen Gethner, Leslie Hogben, Bernard Lidický, Florian Pfender, Amanda Ruiz, Michael Young
On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs. J. Graph Theory 84 (4) (2017)
Zhanar Berikkyzy, Christopher Cox, Michael Dairyko, Kirsten Hogenson, Mohit Kumbhat, Bernard Lidický, Kacy Messerschmidt, Kevin Moss, Kathleen Nowak, Kevin F. Palmowski, Derrick Stolee
(4, 2)-Choosability of Planar Graphs with Forbidden Structures. Graphs Comb. 33 (4) (2017)
Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle
5-list-coloring planar graphs with distant precolored vertices. J. Comb. Theory, Ser. B 122 (2017)
Zdenek Dvorák, Bernard Lidický, Bojan Mohar
5-choosability of graphs with crossings far apart. J. Comb. Theory, Ser. B 123 (2017)
Boris Brimkov, Jennifer Edmond, Robert Lazar, Bernard Lidický, Kacy Messerschmidt, Shanise Walker
Injective choosability of subcubic planar graphs with girth 6. Discret. Math. 340 (10) (2017)
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) (2017)
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla
On the tree search problem with non-uniform costs. Theor. Comput. Sci. 647 (2016)
Ilkyoo Choi, Bernard Lidický, Derrick Stolee
On Choosability with Separation of Planar Graphs with Forbidden Cycles. J. Graph Theory 81 (3) (2016)
Zdenek Dvorák, Bernard Lidický
Independent sets near the lower bound in bounded degree graphs. CoRR (2016)
József Balogh, Michelle Delcourt, Bernard Lidický, Cory Palmer
in edge-colored hypercubes. Discret. Appl. Math. 210 (2016)
József Balogh, Ping Hu, Bernard Lidický, Florian Pfender
Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle. Eur. J. Comb. 52 (2016)
József Balogh, Ping Hu, Bernard Lidický, Oleg Pikhurko, Balázs Udvari, Jan Volec
Minimum Number of Monotone Subsequences of Length 4 in Permutations. Comb. Probab. Comput. 24 (4) (2015)
Zdenek Dvorák, Bernard Lidický
3-Coloring Triangle-Free Planar Graphs with a Precolored 8-Cycle. J. Graph Theory 80 (2) (2015)
Hal A. Kierstead, Bernard Lidický
On choosability with separation of planar graphs with lists of different sizes. Discret. Math. 338 (10) (2015)
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla
On the Tree Search Problem with Non-uniform Costs. WG (2015)
Jan Kyncl, Bernard Lidický, Tomás Vyskocil
Irreversible 2-conversion set in graphs of bounded degree. CoRR (2014)
Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
Short proofs of coloring theorems on planar graphs. Eur. J. Comb. 36 (2014)
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla
On the Tree Search Problem with Non-uniform Costs. CoRR (2014)
József Balogh, Ping Hu, Bernard Lidický, Hong Liu
Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube. Eur. J. Comb. 35 (2014)
Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle. IWOCA (2014)
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 (2014)
Zdenek Dvorák, Bernard Lidický
4-Critical Graphs on Surfaces Without Contractible $(\le\!4)$-Cycles. SIAM J. Discret. Math. 28 (1) (2014)
Zdenek Dvorák, Bernard Lidický
4-critical graphs on surfaces without contractible (<=4)-cycles CoRR (2013)
Zdenek Dvorák, Bernard Lidický
3-coloring triangle-free planar graphs with a precolored 8-cycle CoRR (2013)
Sariel Har-Peled, Bernard Lidický
Peeling the Grid. SIAM J. Discret. Math. 27 (2) (2013)
Sariel Har-Peled, Bernard Lidický
Peeling the Grid CoRR (2013)
Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. Graphs Comb. 29 (4) (2013)
Hong Liu, Bernard Lidický, Cory Palmer
On the Turán Number of Forests. Electron. J. Comb. 20 (2) (2013)
Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
Planar 4-critical graphs with four triangles. CoRR (2013)
Hal A. Kierstead, Bernard Lidický
On choosability with separation of planar graphs with lists of different sizes. CoRR (2013)
Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle
5-list-coloring planar graphs with distant precolored vertices CoRR (2012)
Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma
Finding vertex-surjective graph homomorphisms. Acta Informatica 49 (6) (2012)
Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma
Finding vertex-surjective graph homomorphisms CoRR (2012)
Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma
The k-in-a-Path Problem for Claw-free Graphs. Algorithmica 62 (1-2) (2012)
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma
Distance three labelings of trees. Discret. Appl. Math. 160 (6) (2012)
Zdenek Dvorák, Bernard Lidický, Riste Skrekovski
Bipartizing fullerenes. Eur. J. Comb. 33 (6) (2012)
Jan Ekstein, Premysl Holub, Bernard Lidický
Packing chromatic number of distance graphs. Discret. Appl. Math. 160 (4-5) (2012)
Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma
Finding Vertex-Surjective Graph Homomorphisms. CSR (2012)
Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
Short proofs of coloring theorems on planar graphs CoRR (2012)
Rok Erman, Frédéric Havet, Bernard Lidický, Ondrej Pangrác
5-Coloring Graphs with 4 Crossings. SIAM J. Discret. Math. 25 (1) (2011)
Ondrej Bílka, Bernard Lidický, Marek Tesar
Locally Injective Homomorphism to the Simple Weight Graphs. TAMC (2011)
Jan Ekstein, Premysl Holub, Bernard Lidický
Packing Chromatic Number of Distance Graphs CoRR (2011)
Zdenek Dvorák, Bernard Lidický, Riste Skrekovski
Randić index and the diameter of a graph. Eur. J. Comb. 32 (3) (2011)
Zdenek Dvorák, Bernard Lidický, Riste Skrekovski
Graphs with Two Crossings Are 5-Choosable. SIAM J. Discret. Math. 25 (4) (2011)
Jan Ekstein, Jirí Fiala, Premysl Holub, Bernard Lidický
The packing chromatic number of the square lattice is at least 12 CoRR (2010)
Tomás Kaiser, Daniel Král', Bernard Lidický, Pavel Nejedlý, Robert Sámal
Short Cycle Covers of Graphs with Minimum Degree Three. SIAM J. Discret. Math. 24 (1) (2010)
Zdenek Dvorák, Bernard Lidický, Riste Skrekovski
3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles. SIAM J. Discret. Math. 24 (3) (2010)
Bernard Lidický, Marek Tesar
Complexity of Locally Injective Homomorphism to the Theta Graphs. IWOCA (2010)
Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma
The k-in-a-path Problem for Claw-free Graphs. STACS (2010)
Petr A. Golovach, Bernard Lidický, Daniël Paulusma
(2, 1, 1)-Labeling Is NP-Complete for Trees. TAMC (2010)
Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický
6-Critical Graphs on the Klein Bottle. SIAM J. Discret. Math. 23 (1) (2009)
Jirí Fiala, Sandi Klavzar, Bernard Lidický
The packing chromatic number of infinite product graphs. Eur. J. Comb. 30 (5) (2009)
Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. Graph Drawing (2009)
Bernard Lidický
On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles. Australas. J Comb. 44 (2009)
Zdenek Dvorák, Bernard Lidický, Riste Skrekovski
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable. Discret. Math. 309 (20) (2009)
Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma
The k-in-a-path problem for claw-free graphs CoRR (2009)
Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. Graph Drawing (2008)

Bernard Lidický.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Bernard Lidický