Haj\'os' cycle conjecture for small graphs
Combinatorics
2017-05-25 v1
Abstract
Haj\'os' 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\'os' conjecture for all Eulerian graphs with up to twelve nodes.
Keywords
Cite
@article{arxiv.1705.08724,
title = {Haj\'os' cycle conjecture for small graphs},
author = {Irene Heinrich and Marco V. Natale and Manuel Streicher},
journal= {arXiv preprint arXiv:1705.08724},
year = {2017}
}
Comments
8 pages, 1 figure