Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Radek Hušek"'
Publikováno v:
Journal of Graph Theory. 93:317-327
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3372ab024217877baec016c94ba2a70
https://doi.org/10.1002/jgt.22488
https://doi.org/10.1002/jgt.22488
Autor:
Robert Šámal, Radek Hušek
Publikováno v:
Trends in Mathematics ISBN: 9783030838225
Several recent results and conjectures study counting versions of classical existence statements. We ask the same question for circuit double covers of cubic graphs. We prove an exponential bound for planar graphs: Every bridgeless cubic planar graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c994334602d21a422c568a0176afc71
https://doi.org/10.1007/978-3-030-83823-2_126
https://doi.org/10.1007/978-3-030-83823-2_126
Autor:
Radek Hušek, Robert Šámal
Publikováno v:
Electronic Notes in Discrete Mathematics. 61:639-645
We study the following conjecture of Matt DeVos: If there is a graph homomorphism from a Cayley graph $\mathrm{Cay}(M, B)$ to another Cayley graph $\mathrm{Cay}(M', B')$ then every graph with an $(M,B)$-flow has an $(M',B')$-flow. This conjecture was
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca14c18bd3c065f7f36a81463ec71e87
https://doi.org/10.1016/j.endm.2017.07.018
https://doi.org/10.1016/j.endm.2017.07.018
Autor:
Ondřej Čepek, Radek Hušek
Publikováno v:
Discrete Optimization. 23:1-19
In this paper we focus on a less common way how to represent Boolean functions, namely on representations by intervals of truepoints and by switch-lists. There are two problems connected to such representation: (1) a knowledge compilation problem, i.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8ce9190949e26b8ab85f1ad9dfcff6b
https://doi.org/10.1016/j.disopt.2016.11.002
https://doi.org/10.1016/j.disopt.2016.11.002