Bernard Lidický

105 papers A* 1A 4B 1C 4Misc 1Journal 94

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