Showing 2025Show all
2 papers · 1 filter
math.CO2025
Approximate cycle double cover
Babak Ghanbari, Robert Šámal
The Cycle double cover (CDC) conjecture states that for every bridgeless graph , there exists a family of cycles such that each edge of the graph is contained in e…
cs.DS2025
On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
Babak Ghanbari, Robert Šámal
We present an algorithm for finding a perfect matching in a -edge-connected cubic graph that intersects every -edge cut in exactly one edge. Specifically, we propose an algor…