default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernard Lidický
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j70]Eun-Kyung Cho, Ilkyoo Choi
, Bernard Lidický:
Relaxation of Wegner's planar graph conjecture for maximum degree 4. Discret. Appl. Math. 358: 254-261 (2024)- [j69]József Balogh, Felix Christian Clemen, Bernard Lidický:
10 problems for partitions of triangle-free graphs. Eur. J. Comb. 121: 103841 (2024) - [i19]Anastasia Halfpap, Bernard Lidický, Tomás Masarík:
Proper Rainbow Saturation Numbers for Cycles. CoRR abs/2403.15602 (2024) - 2023
- [j68]Rachel Kirsch, Bernard Lidický, Clare Sibley, Elizabeth Sprangel:
Shortened universal cycles for permutations. Discret. Appl. Math. 324: 219-228 (2023) - [j67]Bernard Lidický, Connor Mattes, Florian Pfender:
C5 ${C}_{5}$ is almost a fractalizer. J. Graph Theory 104(1): 220-244 (2023) - [j66]József Balogh, Felix Christian Clemen, Bernard Lidický, Sergey Norin, Jan Volec:
The Spectrum of Triangle-Free Graphs. SIAM J. Discret. Math. 37(2): 1173-1179 (2023) - [c12]József Balogh, Bernard Lidický, Sergey Norin, Florian Pfender, Gelasio Salazar, Sam Spiro:
Crossing numbers of complete bipartite graphs. LAGOS 2023: 78-87 - [c11]József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao:
Nearly All k-SAT Functions Are Unate. STOC 2023: 958-962 - [i18]Caroline Bang, Zdenek Dvorák, Emily Heath, Bernard Lidický:
Embedded graph 3-coloring and flows. CoRR abs/2303.05583 (2023) - 2022
- [j65]Jane Breen, Steve Butler, Melissa M. 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) - [j64]Daniel W. Cranston, Bernard Lidický, Xiaonan Liu, Abhinav Shantanam:
Planar Turán Numbers of Cycles: A Counterexample. Electron. J. Comb. 29(3) (2022) - [j63]József Balogh, Felix Christian Clemen, Bernard Lidický:
Maximum number of almost similar triangles in the plane. Comput. Geom. 105-106: 101880 (2022) - [j62]Andrzej Grzesik, Joonkyung Lee, Bernard Lidický, Jan Volec:
On tripartite common graphs. Comb. Probab. Comput. 31(5): 907-923 (2022) - [j61]Bernard Lidický, Tomás Masarík, Kyle Murphy, Shira Zerbib:
On Weak Flexibility in Planar Graphs. Graphs Comb. 38(6): 180 (2022) - [j60]Zdenek Dvorák, Bernard Lidický:
Coloring count cones of planar graphs. J. Graph Theory 100(1): 84-100 (2022) - [j59]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): 1678-1686 (2022) - [i17]József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao:
Nearly all k-SAT functions are unate. CoRR abs/2209.04894 (2022) - 2021
- [j58]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): 271-287 (2021) - [j57]József Balogh, Felix Christian Clemen, Mikhail Lavrov, Bernard Lidický, Florian Pfender:
Making Kr+1-free graphs r-partite. Comb. Probab. Comput. 30(4): 609-618 (2021) - [j56]Bernard Lidický, Kyle Murphy:
Maximizing five-cycles in Kr-free graphs. Eur. J. Comb. 97: 103367 (2021) - [j55]Bernard Lidický, Florian Pfender:
Semidefinite Programming and Ramsey Numbers. SIAM J. Discret. Math. 35(4): 2328-2344 (2021) - 2020
- [j54]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): 44-67 (2020) - [j53]Ilkyoo Choi, Bernard Lidický, Florian Pfender:
Inducibility of directed paths. Discret. Math. 343(10): 112015 (2020) - [j52]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): 252-266 (2020) - [i16]Bernard Lidický, Tomás Masarík, Kyle Murphy, Shira Zerbib:
On Weak Flexibility in Planar Graphs. CoRR abs/2009.07932 (2020)
2010 – 2019
- 2019
- [j51]Daniel Král', Bernard Lidický, Taísa L. Martins, Yanitsa Pehova:
Decomposing Graphs into Edges and Triangles. Comb. Probab. Comput. 28(3): 465-472 (2019) - [j50]Bernard Lidický, Kacy Messerschmidt, Riste Skrekovski:
Facial unique-maximum colorings of plane graphs with restriction on big vertices. Discret. Math. 342(9): 2612-2617 (2019) - [j49]Maria Axenovich, John L. Goldwasser, Bernard Lidický, Ryan R. Martin, David Offner, John M. Talbot, Michael Young:
Polychromatic Colorings on the Integers. Integers 19: A18 (2019) - [j48]Matija Bucic, Bernard Lidický, Jason Long, Adam Zsolt Wagner:
Partition problems in high dimensional boxes. J. Comb. Theory A 166: 315-336 (2019) - [j47]József Balogh, Bernard Lidický, Gelasio Salazar:
Closing in on Hill's Conjecture. SIAM J. Discret. Math. 33(3): 1261-1276 (2019) - 2018
- [j46]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): 3 (2018) - [j45]Vesna Andova, Bernard Lidický, Borut Luzar, Riste Skrekovski:
On facial unique-maximum (edge-)coloring. Discret. Appl. Math. 237: 26-32 (2018) - [j44]Bernard Lidický, Kacy Messerschmidt, Riste Skrekovski:
A counterexample to a conjecture on facial unique-maximal colorings. Discret. Appl. Math. 237: 123-125 (2018) - [j43]Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický:
3-coloring triangle-free planar graphs with a precolored 9-cycle. Eur. J. Comb. 68: 38-65 (2018) - [j42]Bernard Lidický, Florian Pfender:
Pentagons in triangle-free graphs. Eur. J. Comb. 74: 85-89 (2018) - [j41]Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender:
Notes on complexity of packing coloring. Inf. Process. Lett. 137: 6-10 (2018) - [j40]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): 660-671 (2018) - [j39]Zdenek Dvorák, Bernard Lidický:
Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces. SIAM J. Discret. Math. 32(1): 94-105 (2018) - [j38]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): 1775-1805 (2018) - 2017
- [j37]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): 2538-2549 (2017) - [j36]Jan Kyncl, Bernard Lidický, Tomás Vyskocil:
Irreversible 2-conversion set in graphs of bounded degree. Discret. Math. Theor. Comput. Sci. 19(3) (2017) - [j35]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): 751-787 (2017) - [j34]Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle:
5-list-coloring planar graphs with distant precolored vertices. J. Comb. Theory B 122: 311-352 (2017) - [j33]Zdenek Dvorák, Bernard Lidický, Bojan Mohar:
5-choosability of graphs with crossings far apart. J. Comb. Theory B 123: 54-96 (2017) - [j32]József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young:
Rainbow triangles in three-colored graphs. J. Comb. Theory B 126: 83-113 (2017) - [j31]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): 552-565 (2017) - [j30]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): 865-874 (2017) - [c10]Zdenek Dvorák, Bernard Lidický:
Independent Sets near the Lower Bound in Bounded Degree Graphs. STACS 2017: 28:1-28:13 - [i15]Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender:
Notes on complexity of packing coloring. CoRR abs/1712.08373 (2017) - 2016
- [j29]József Balogh, Michelle Delcourt, Bernard Lidický, Cory Palmer:
Rainbow copies of C4 in edge-colored hypercubes. Discret. Appl. Math. 210: 35-37 (2016) - [j28]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: 47-58 (2016) - [j27]Ilkyoo Choi, Bernard Lidický, Derrick Stolee:
On Choosability with Separation of Planar Graphs with Forbidden Cycles. J. Graph Theory 81(3): 283-306 (2016) - [j26]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: 22-32 (2016) - [i14]Zdenek Dvorák, Bernard Lidický:
Independent sets near the lower bound in bounded degree graphs. CoRR abs/1609.09134 (2016) - 2015
- [j25]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): 658-679 (2015) - [j24]Hal A. Kierstead, Bernard Lidický:
On choosability with separation of planar graphs with lists of different sizes. Discret. Math. 338(10): 1779-1783 (2015) - [j23]Zdenek Dvorák, Bernard Lidický:
3-Coloring Triangle-Free Planar Graphs with a Precolored 8-Cycle. J. Graph Theory 80(2): 98-111 (2015) - [c9]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: 90-102 - 2014
- [j22]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: 75-85 (2014) - [j21]Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey:
Short proofs of coloring theorems on planar graphs. Eur. J. Comb. 36: 314-321 (2014) - [j20]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: 138-151 (2014) - [j19]Zdenek Dvorák, Bernard Lidický:
4-Critical Graphs on Surfaces Without Contractible $(\le\!4)$-Cycles. SIAM J. Discret. Math. 28(1): 521-552 (2014) - [c8]Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický:
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle. IWOCA 2014: 98-109 - [i13]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 abs/1404.4504 (2014) - [i12]Jan Kyncl, Bernard Lidický, Tomás Vyskocil:
Irreversible 2-conversion set in graphs of bounded degree. CoRR abs/1412.4188 (2014) - 2013
- [j18]Hong Liu, Bernard Lidický, Cory Palmer:
On the Turán Number of Forests. Electron. J. Comb. 20(2): 62 (2013) - [j17]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): 981-1005 (2013) - [j16]Sariel Har-Peled, Bernard Lidický:
Peeling the Grid. SIAM J. Discret. Math. 27(2): 650-655 (2013) - [i11]Sariel Har-Peled, Bernard Lidický:
Peeling the Grid. CoRR abs/1302.3200 (2013) - [i10]Zdenek Dvorák, Bernard Lidický:
3-coloring triangle-free planar graphs with a precolored 8-cycle. CoRR abs/1305.2467 (2013) - [i9]Zdenek Dvorák, Bernard Lidický:
4-critical graphs on surfaces without contractible (<=4)-cycles. CoRR abs/1305.2670 (2013) - [i8]Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey:
Planar 4-critical graphs with four triangles. CoRR abs/1306.1477 (2013) - [i7]Hal A. Kierstead, Bernard Lidický:
On choosability with separation of planar graphs with lists of different sizes. CoRR abs/1306.5283 (2013) - 2012
- [j15]Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma:
Finding vertex-surjective graph homomorphisms. Acta Informatica 49(6): 381-394 (2012) - [j14]Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma:
The k-in-a-Path Problem for Claw-free Graphs. Algorithmica 62(1-2): 499-519 (2012) - [j13]Jan Ekstein, Premysl Holub, Bernard Lidický:
Packing chromatic number of distance graphs. Discret. Appl. Math. 160(4-5): 518-524 (2012) - [j12]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma:
Distance three labelings of trees. Discret. Appl. Math. 160(6): 764-779 (2012) - [j11]Zdenek Dvorák, Bernard Lidický, Riste Skrekovski:
Bipartizing fullerenes. Eur. J. Comb. 33(6): 1286-1293 (2012) - [c7]Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma:
Finding Vertex-Surjective Graph Homomorphisms. CSR 2012: 160-171 - [i6]Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma:
Finding vertex-surjective graph homomorphisms. CoRR abs/1204.2124 (2012) - [i5]Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle:
5-list-coloring planar graphs with distant precolored vertices. CoRR abs/1209.0366 (2012) - [i4]Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey:
Short proofs of coloring theorems on planar graphs. CoRR abs/1211.3981 (2012) - 2011
- [j10]Zdenek Dvorák, Bernard Lidický, Riste Skrekovski:
Randić index and the diameter of a graph. Eur. J. Comb. 32(3): 434-442 (2011) - [j9]Rok Erman, Frédéric Havet, Bernard Lidický, Ondrej Pangrác:
5-Coloring Graphs with 4 Crossings. SIAM J. Discret. Math. 25(1): 401-422 (2011) - [j8]Zdenek Dvorák, Bernard Lidický, Riste Skrekovski:
Graphs with Two Crossings Are 5-Choosable. SIAM J. Discret. Math. 25(4): 1746-1753 (2011) - [c6]Ondrej Bílka, Bernard Lidický, Marek Tesar:
Locally Injective Homomorphism to the Simple Weight Graphs. TAMC 2011: 471-482 - [i3]Jan Ekstein, Premysl Holub, Bernard Lidický:
Packing Chromatic Number of Distance Graphs. CoRR abs/1105.5652 (2011) - 2010
- [j7]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): 330-355 (2010) - [j6]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): 934-945 (2010) - [c5]Bernard Lidický, Marek Tesar:
Complexity of Locally Injective Homomorphism to the Theta Graphs. IWOCA 2010: 326-336 - [c4]Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma:
The k-in-a-path Problem for Claw-free Graphs. STACS 2010: 371-382 - [c3]Petr A. Golovach, Bernard Lidický, Daniël Paulusma:
L(2, 1, 1)-Labeling Is NP-Complete for Trees. TAMC 2010: 211-221 - [i2]Jan Ekstein, Jirí Fiala, Premysl Holub, Bernard Lidický:
The packing chromatic number of the square lattice is at least 12. CoRR abs/1003.2291 (2010)
2000 – 2009
- 2009
- [j5]Bernard Lidický:
On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles. Australas. J Comb. 44: 77-86 (2009) - [j4]Zdenek Dvorák, Bernard Lidický, Riste Skrekovski:
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable. Discret. Math. 309(20): 5899-5904 (2009) - [j3]Jirí Fiala, Sandi Klavzar, Bernard Lidický:
The packing chromatic number of infinite product graphs. Eur. J. Comb. 30(5): 1101-1113 (2009) - [j2]Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický:
6-Critical Graphs on the Klein Bottle. SIAM J. Discret. Math. 23(1): 372-383 (2009) - [c2]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. GD 2009: 304-315 - [i1]Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma:
The k-in-a-path problem for claw-free graphs. CoRR abs/0912.5468 (2009) - 2008
- [j1]Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický:
Six-Critical Graphs on the Klein Bottle. Electron. Notes Discret. Math. 31: 235-240 (2008) - [c1]Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický:
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. GD 2008: 121-132
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-04 20:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
