B. Alspach, J. Bermond, and D. Sotteau, Decomposition into cycles I: Hamilton decompositions, Cycles and Rays, pp.9-18, 1990.
DOI : 10.1007/978-94-009-0517-7_2

B. Alspach and H. Gavlas, Cycle decomposition of K n and K n ? I, J. Combin. Th. Ser. B, vol.81, pp.77-99, 2001.

L. Anderson and E. Delucchi, Foundations for a theory of complex matroids, Disc, Comput. Geom, vol.48, pp.807-846, 2012.

A. Björner, M. L. Vergnas, B. Sturmfels, N. White, and G. M. Ziegler, of Encyclopedia of Mathematics and its Applications, vol.46, 1999.

R. G. Bland and M. L. Vergnas, Orientability of matroids, J. Combinatorial Theory Ser. B, pp.94-123, 1978.
DOI : 10.1016/0095-8956(78)90080-1
URL : https://doi.org/10.1016/0095-8956(78)90080-1

J. Bokowski, A. Guedes-de-oliviera, U. Thiemann, A. Veloso-da, and C. , On the cube problem of Las Vergnas, Geom. Dedicata, vol.63, pp.25-43, 1996.

J. Bokowski and H. Rohlfs, On a mutation problem for oriented matroids, European J. Combin, vol.22, pp.617-626, 1999.
DOI : 10.1006/eujc.2000.0483
URL : https://doi.org/10.1006/eujc.2000.0483

J. Chappelon, K. Knauer, L. P. Montejano, and J. L. Ramírez-alfonsín, Conncted covering numbers, J. Comb. Design, vol.23, pp.534-549, 2015.
DOI : 10.1002/jcd.21425
URL : http://arxiv.org/pdf/1306.5636

R. Cordovil and P. Duchet, On sign-invariance graphs of uniform oriented matroids, Discrete Math, vol.79, pp.251-257, 1990.
DOI : 10.1016/0012-365x(90)90333-d
URL : https://doi.org/10.1016/0012-365x(90)90333-d

I. P. Silva, Reconstruction of a rank 3 oriented matroid from its rank 2 signed circuits, Graph Theory in, pp.355-364, 2007.

I. P. Silva, Cubes and orientability, Discrete Math, vol.308, pp.3574-3585, 2008.

A. Dress and W. Wenzel, Grassmann plücker relations and matroids with coefficients, vol.86, pp.68-110, 1991.
DOI : 10.1016/0001-8708(91)90036-7
URL : https://doi.org/10.1016/0001-8708(91)90036-7

G. Fan, Subgraph coverings and edge switchings, J. Combin. Theory Ser. B, vol.84, pp.54-83, 2002.
DOI : 10.1006/jctb.2001.2063
URL : https://doi.org/10.1006/jctb.2001.2063

J. Fink, Perfect matchings extend to hamilton cycles in hypercubes, Journal of Combinatorial Theory, Series B, vol.97, pp.1074-1076, 2007.
DOI : 10.1016/j.jctb.2007.02.007
URL : https://doi.org/10.1016/j.jctb.2007.02.007

J. Folkman and J. Lawrence, Oriented matroids, J. Combin. Theory Ser. B, vol.25, pp.199-236, 1978.

D. Forge and J. L. Ramírez-alfonsín, Connected coverings and an application to oriented matroids, Discrete Math, vol.187, pp.109-121, 1998.
DOI : 10.1016/s0012-365x(97)00246-x
URL : https://doi.org/10.1016/s0012-365x(97)00246-x

D. Forge, J. L. Ramírez-alfonsín, and H. Yeun, Disconnected coverings for oriented matroids via simultaneous mutations, Discrete Math, vol.258, pp.353-359, 2002.

M. R. Garey, D. S. Johnson, and H. C. So, An application of graph coloring to printed circuit testing, IEEE Trans. Circuits and Systems, pp.591-599, 1976.

I. Gelfand, G. Rybnikov, and D. Stone, Projective orientations of matroids, vol.113, pp.118-150, 1995.

C. Godsil and G. Royle, Algebraic graph theory, 2001.

F. Hadlock, Finding a maximum cut of a planar graph in polynomial time, SIAM J. Comput, vol.4, pp.221-225, 1975.

Y. O. Hamidoune and M. L. Vergnas, Directed switching games on graphs and matroids, J. Combin. Theory Ser. B, vol.40, pp.237-269, 1986.
DOI : 10.1016/0095-8956(86)90083-3
URL : https://doi.org/10.1016/0095-8956(86)90083-3

H. Lai and X. Li, Small cycle cover of 2-connected cubic graphs, Discrete Math, vol.269, pp.295-302, 2003.

M. L. Vergnas, J. Roudneff, and I. Saläun, Regular polytopes and oriented matroids, p.12, 1989.

A. Lehman, A solution of the Shannon switching game, J. Soc. Indust. Appl. Math, vol.12, pp.687-725, 1964.

M. Lemos and J. Oxley, Matroid packing and covering with circuits through an element, Journal of Combinatorial Theory, Series B, vol.96, pp.135-158, 2006.

F. Levi, Die Teilung der projektiven Ebene durch Gerade oder Pseudogerade, Ber. Math.-Phy. KI. Sachs. Akad. Wiss. Leipzig, vol.78, pp.256-267, 1926.

D. W. , Matula, k-components, clusters and slicings in graphs, SIAM J. Appl. Math, vol.22, pp.459-480, 1972.

S. Mcguinness, Circuit and fractional circuit covers of matroids, European Journal of Combinatorics, vol.31, pp.1335-1341, 2010.

J. Oxley, of Oxford Graduate Texts in Mathematics, vol.3, 2006.

J. Roudneff, Reconstruction of the orientation class of an oriented matroid, European J. Combin, vol.9, pp.423-429, 1988.

J. Roudneff and B. Sturmfels, Simplicial cells in arrangements and mutuations of oriented matroids, Geometriae Dedicata, vol.27, pp.153-170, 1988.

P. Seymour, Packing and covering with matroid circuits, Journal of Combinatorial Theory, Series B, vol.28, pp.237-242, 1980.
DOI : 10.1016/0095-8956(80)90067-2
URL : https://doi.org/10.1016/0095-8956(80)90067-2

R. W. Shannon, Simplicial cells in arrangements of hyperplanes, Geometriae Dedicata, vol.8, pp.179-187, 1979.

F. Yang and X. Li, Small cycle covers of 3-connected cubic graphs, Discrete Math, vol.311, pp.186-196, 2011.

, Faculté des Sciences de Luminy, F-13288 Marseille Cedex 09