Bernard Lidický

Orcid: 0000-0001-8612-3594

According to our database1, Bernard Lidický authored at least 78 papers between 2008 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
C5 ${C}_{5}$ is almost a fractalizer.
J. Graph Theory, September, 2023

The Spectrum of Triangle-Free Graphs.
SIAM J. Discret. Math., June, 2023

Shortened universal cycles for permutations.
Discret. Appl. Math., 2023

Embedded graph 3-coloring and flows.
CoRR, 2023

Nearly All k-SAT Functions Are Unate.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Crossing numbers of complete bipartite graphs.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022
Counterexamples to a Conjecture of Harris on Hall Ratio.
SIAM J. Discret. Math., 2022

Coloring count cones of planar graphs.
J. Graph Theory, 2022

On Weak Flexibility in Planar Graphs.
Graphs Comb., 2022

On tripartite common graphs.
Comb. Probab. Comput., 2022

Maximum number of almost similar triangles in the plane.
Comput. Geom., 2022

Planar Turán Numbers of Cycles: A Counterexample.
Electron. J. Comb., 2022

Hadamard Diagonalizable Graphs of Order at Most 36.
Electron. J. Comb., 2022

2021
Semidefinite Programming and Ramsey Numbers.
SIAM J. Discret. Math., 2021

Maximizing five-cycles in Kr-free graphs.
Eur. J. Comb., 2021

Sharp bounds for decomposing graphs into edges and triangles.
Comb. Probab. Comput., 2021

Making Kr+1-free graphs r-partite.
Comb. Probab. Comput., 2021

2020
Ore and Chvátal-type degree conditions for bootstrap percolation from small sets.
J. Graph Theory, 2020

Inducibility of directed paths.
Discret. Math., 2020

Minimizing the number of 5-cycles in graphs with given edge-density.
Comb. Probab. Comput., 2020

2019
Closing in on Hill's Conjecture.
SIAM J. Discret. Math., 2019

Partition problems in high dimensional boxes.
J. Comb. Theory, Ser. A, 2019

Polychromatic Colorings on the Integers.
Integers, 2019

Facial unique-maximum colorings of plane graphs with restriction on big vertices.
Discret. Math., 2019

Decomposing Graphs into Edges and Triangles.
Comb. Probab. Comput., 2019

2018
Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains.
SIAM J. Discret. Math., 2018

Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces.
SIAM J. Discret. Math., 2018

Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles.
J. Graph Theory, 2018

Notes on complexity of packing coloring.
Inf. Process. Lett., 2018

Pentagons in triangle-free graphs.
Eur. J. Comb., 2018

3-coloring triangle-free planar graphs with a precolored 9-cycle.
Eur. J. Comb., 2018

A counterexample to a conjecture on facial unique-maximal colorings.
Discret. Appl. Math., 2018

On facial unique-maximum (edge-)coloring.
Discret. Appl. Math., 2018

On the Strong Chromatic Index of Sparse Graphs.
Electron. J. Comb., 2018

2017
Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles.
SIAM J. Discret. Math., 2017

On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs.
J. Graph Theory, 2017

5-list-coloring planar graphs with distant precolored vertices.
J. Comb. Theory, Ser. B, 2017

5-choosability of graphs with crossings far apart.
J. Comb. Theory, Ser. B, 2017

Rainbow triangles in three-colored graphs.
J. Comb. Theory, Ser. B, 2017

(4, 2)-Choosability of Planar Graphs with Forbidden Structures.
Graphs Comb., 2017

Irreversible 2-conversion set in graphs of bounded degree.
Discret. Math. Theor. Comput. Sci., 2017

Injective choosability of subcubic planar graphs with girth 6.
Discret. Math., 2017

Independent Sets near the Lower Bound in Bounded Degree Graphs.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2016
On the tree search problem with non-uniform costs.
Theor. Comput. Sci., 2016

On Choosability with Separation of Planar Graphs with Forbidden Cycles.
J. Graph Theory, 2016

Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle.
Eur. J. Comb., 2016

Rainbow copies of C<sub>4</sub> in edge-colored hypercubes.
Discret. Appl. Math., 2016

2015
3-Coloring Triangle-Free Planar Graphs with a Precolored 8-Cycle.
J. Graph Theory, 2015

On choosability with separation of planar graphs with lists of different sizes.
Discret. Math., 2015

Minimum Number of Monotone Subsequences of Length 4 in Permutations.
Comb. Probab. Comput., 2015

2014
4-Critical Graphs on Surfaces Without Contractible $(\le\!4)$-Cycles.
SIAM J. Discret. Math., 2014

Short proofs of coloring theorems on planar graphs.
Eur. J. Comb., 2014

Planar 4-critical graphs with four triangles.
Eur. J. Comb., 2014

Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube.
Eur. J. Comb., 2014

2013
Peeling the Grid.
SIAM J. Discret. Math., 2013

The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.
Graphs Comb., 2013

4-critical graphs on surfaces without contractible (<=4)-cycles
CoRR, 2013

On the Turán Number of Forests.
Electron. J. Comb., 2013

2012
Bipartizing fullerenes.
Eur. J. Comb., 2012

Distance three labelings of trees.
Discret. Appl. Math., 2012

Packing chromatic number of distance graphs.
Discret. Appl. Math., 2012

The k-in-a-Path Problem for Claw-free Graphs.
Algorithmica, 2012

Finding vertex-surjective graph homomorphisms.
Acta Informatica, 2012

2011
5-Coloring Graphs with 4 Crossings.
SIAM J. Discret. Math., 2011

Graphs with Two Crossings Are 5-Choosable.
SIAM J. Discret. Math., 2011

Randić index and the diameter of a graph.
Eur. J. Comb., 2011

Locally Injective Homomorphism to the Simple Weight Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2011

2010
Short Cycle Covers of Graphs with Minimum Degree Three.
SIAM J. Discret. Math., 2010

3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles.
SIAM J. Discret. Math., 2010

The packing chromatic number of the square lattice is at least 12
CoRR, 2010

<i>L</i>(2, 1, 1)-Labeling Is NP-Complete for Trees.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Complexity of Locally Injective Homomorphism to the Theta Graphs.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009
6-Critical Graphs on the Klein Bottle.
SIAM J. Discret. Math., 2009

The packing chromatic number of infinite product graphs.
Eur. J. Comb., 2009

Planar graphs without 3-, 7-, and 8-cycles are 3-choosable.
Discret. Math., 2009

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

2008
Six-Critical Graphs on the Klein Bottle.
Electron. Notes Discret. Math., 2008

Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters.
Proceedings of the Graph Drawing, 16th International Symposium, 2008


  Loading...