Bernard Lidický

According to our database1, Bernard Lidický
  • authored at least 55 papers between 2008 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs.
Journal of 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

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.
Journal of 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 C4 in edge-colored hypercubes.
Discrete Applied Mathematics, 2016

Independent sets near the lower bound in bounded degree graphs.
CoRR, 2016

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

On choosability with separation of planar graphs with lists of different sizes.
Discrete Mathematics, 2015

Minimum Number of Monotone Subsequences of Length 4 in Permutations.
Combinatorics, Probability & Computing, 2015

On the Tree Search Problem with Non-uniform Costs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014
4-Critical Graphs on Surfaces Without Contractible $(\le\!4)$-Cycles.
SIAM J. Discrete 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

Irreversible 2-conversion set in graphs of bounded degree.
CoRR, 2014

On the Tree Search Problem with Non-uniform Costs.
CoRR, 2014

3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

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

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

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

3-coloring triangle-free planar graphs with a precolored 8-cycle
CoRR, 2013

Peeling the Grid
CoRR, 2013

On choosability with separation of planar graphs with lists of different sizes.
CoRR, 2013

Planar 4-critical graphs with four triangles.
CoRR, 2013

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

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

Distance three labelings of trees.
Discrete Applied Mathematics, 2012

Packing chromatic number of distance graphs.
Discrete Applied Mathematics, 2012

Short proofs of coloring theorems on planar graphs
CoRR, 2012

5-list-coloring planar graphs with distant precolored vertices
CoRR, 2012

Finding vertex-surjective graph homomorphisms
CoRR, 2012

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

Finding vertex-surjective graph homomorphisms.
Acta Inf., 2012

Finding Vertex-Surjective Graph Homomorphisms.
Proceedings of the Computer Science - Theory and Applications, 2012

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

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

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

Packing Chromatic Number of Distance Graphs
CoRR, 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. Discrete Math., 2010

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

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

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

The k-in-a-path Problem for Claw-free Graphs.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 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. Discrete 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.
Discrete Mathematics, 2009

The k-in-a-path problem for claw-free graphs
CoRR, 2009

The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

2008
Six-Critical Graphs on the Klein Bottle.
Electronic Notes in Discrete Mathematics, 2008

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


  Loading...