Haj\'os' cycle conjecture for small graphs
classification
🧮 math.CO
keywords
conjectureeuleriangraphscyclecyclesdecomposeddescribeedge-disjoint
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.