Technical Reports - DIT-02-050
1999, Note: Published in: Discrete Mathematics 234 (2001) 181-186.
Keywords: even circuit decomposition, eulerian graph, K_5.
Abstract:A circuit decomposition of a graph G=(V,E) is a partition of E into circuits. A decomposition is said even if all its circuits have even length. We give a negative answer to a question posed by Jackson asking whether K_5 is the only 4-connected eulerian graph with an even number of edges but no even circuit decomposition.