( en | de | ru )

 

Disambiguation of "Lidický, Bernard"

Author of the publication

copydeleteadd this publication to your clipboard
Crossing numbers of complete bipartite graphs.

, , , , , and . LAGOS, volume 223 of Procedia Computer Science, page 78-87. Elsevier, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dirk Bernard

Bernard Broermann

Bernard Andreae

Bernard Willkofer

Bernard Schmidtmann

 

Other publications of authors with the same name

The k-in-a-path problem for claw-free graphs, , , and . CoRR, (2009)On the Tree Search Problem with Non-uniform Costs., , , , and . WG, volume 9224 of Lecture Notes in Computer Science, page 90-102. Springer, (2015)L(2, 1, 1)-Labeling Is NP-Complete for Trees., , and . TAMC, volume 6108 of Lecture Notes in Computer Science, page 211-221. Springer, (2010)Irreversible 2-conversion set in graphs of bounded degree., , and . Discret. Math. Theor. Comput. Sci., (2017)Complexity of Locally Injective Homomorphism to the Theta Graphs., and . IWOCA, volume 6460 of Lecture Notes in Computer Science, page 326-336. Springer, (2010)Minimizing the number of 5-cycles in graphs with given edge-density., , , and . Comb. Probab. Comput., 29 (1): 44-67 (2020)Counterexamples to a Conjecture of Harris on Hall Ratio., , , , , and . SIAM J. Discret. Math., 36 (3): 1678-1686 (2022)On choosability with separation of planar graphs with lists of different sizes., and . Discret. Math., 338 (10): 1779-1783 (2015)4-critical graphs on surfaces without contractible (<=4)-cycles, and . CoRR, (2013)Irreversible 2-conversion set in graphs of bounded degree., , and . CoRR, (2014)