2 citations · 4 across the 22 of their papers we have counts for
1 paper · 1 filter
Morteza Hasanvand
In this paper, we show that every highly edge-connected graph G, under a necessary and sufficient degree condition, can be edge-decomposed into k factors G1,…,Gk such…