论文部分内容阅读
Hajós conjectured that every simple even graph on n vertices can be decomposed into at most n/2 cycles(see L.Lovasz,On covering of graphs,in: P.Erdos,G.O.H.Katona(Eds.),Theory of Graphs,Academic Press,New York,1968,pp.231-236).