2 citations · 2 across the 1 of their papers we have counts for
1 paper
Irene Heinrich, Marco V. Natale, Manuel Streicher
Hajós' conjecture states that an Eulerian graph of order n can be decomposed into at most (n-1)/2 edge-disjoint cycles. We describe preprocessing steps, heuristics and integer prog…