Hajós' cycle conjecture for small graphs

Abstract

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 programming techniques that enable us to verify Hajós' conjecture for all Eulerian graphs with up to twelve nodes.

8 pages, 1 figure