On 4-connected graphs without even cycle decompositions

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.