Graphes orientes indécomposables en circuits hamiltoniens

Abstract

Let G be a cubic graph of order 2 n consisting of a cycle plus a perfect matching and let G ∗ be the symmetric digraph obtained from G by replacing each edge of G by two opposite arcs. In this paper we study when G ∗ can be decomposed into three hamiltonian circuits and in particular we prove that such a decomposition is impossible if n is even.