Hajós’ conjecture and projective graphs Original Research Article

Hajós’ conjecture asserts that a simple eulerian graph on n vertices can be decomposed into at most (n−1)/2 circuits. In this paper, as corollaries of the main result, we show that Hajós’ conjecture is true for projective graphs and K6−-minor free graphs.