2 citations · 3 across the 4 of their papers we have counts for
5 papers
Exponentially Many Circuit Double Covers
Radek Hušek, Robert Šámal
The cycle double cover conjecture of Szekeres and Seymour, the proof of which was recently announced by OpenAI, states that every bridgeless graph has a collection of cycles coveri…
Counting Circuit Double Covers
Radek Hušek, Robert Šámal
We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to for some ) instead of cyc…
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
Radek Hušek, Dušan Knop, Tomáš Masařík
In the Steiner Tree problem we are given an edge weighted undirected graph and a set of terminals . The task is to find a connected subgraph of conta…
Homomorphisms of Cayley graphs and Cycle Double Covers
Radek Hušek, Robert Šámal
We study the following conjecture of Matt DeVos: If there is a graph homomorphism from Cayley graph Cay(M, B) to another Cayley graph Cay(M', B') then every graph with an (M, B)-fl…
Group Connectivity: v.
Radek Hušek, Lucie Mohelníková, Robert Šámal
We answer a question on group connectivity suggested by Jaeger et al. [Group connectivity of graphs -- A nonhomogeneous analogue of nowhere-zero flow properties, JCTB 1992]: we fin…