Haj\'os' cycle conjecture for small graphs

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...

Full description

Saved in:
Bibliographic details
Main Author: Heinrich, Irene
Natale, Marco V
Streicher, Manuel
Format: Publication
Language: English
Place of publication: 24.05.2017
Data of publication: 2017-05-24
Online Access: available in Bonn?
Database: OpenAIRE (Open Access)
Database information Databases - DBIS