1 citations · 1 across the 4 of their papers we have counts for
6 papers
Facial diagrams and cycle double cover
Babak Ghanbari, Robert Šámal
We approach the cycle double cover conjecture by looking for a circular 2-cell embedding of cubic graphs on an arbitrary surface. It is easy to see that if such an embedding exists…
A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
Babak Ghanbari, Robert Šámal
We present a near-linear-time algorithm that, given a bridgeless cubic graph, finds a perfect matching intersecting every 3-edge-cut in exactly one edge. This improves over a cubic…
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…
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…
Structure of betweenness uniform graphs with low values of betweenness centrality
Babak Ghanbari, David Hartman, Vít Jelínek +3
This work deals with undirected graphs that have the same betweenness centrality for each vertex, so-called betweenness uniform graphs (or BUGs). The class of these graphs is not t…
Fractional forcing number of graphs
Javad B. Ebrahimi, Babak Ghanbari
The notion of forcing sets for perfect matchings was introduced by Harary, Klein, and Živković. The application of this problem in chemistry, as well as its interesting theoretical…