Multimatroids I. Coverings by independent sets

SIAM Journal on Discrete Mathematics

Volumn 10, Issue 4, 1997, Pages 626-646

  Bouchet, André ^a  

^a UNIVERSITÉ DU MAINE   (France)

Author keywords

Coverings; Euler tours; Matroids

Indexed keywords

EID: 0039357737     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480193242591     Document Type: Article

References (23)

1. L. ANDERSEN, A. BOUCHET, AND B. JACKSON, Orthogonal A-trails of 4-regular graphs embedded in surfaces of low genus, J. Combin. Theory Ser. B, 66 (1996), pp. 232-246.
2. A. BOUCHET, Multimatroid IV, Chain-group representations, submitted.
3. A. BOUCHET, Multimatroids II, Minors and connectivity, submitted.
4. A. BOUCHET, Multimatroids III, Tightness, fundamental graphs, and pivotings, submitted.
5. A. BOUCHET, Greedy algorithm and symmetric matroids, Math. Programming, 38 (1987), pp. 147-159.
6. A. BOUCHET, Isotropic systems, European J. Combin., 8 (1987), pp. 231-244.
7. A. BOUCHET, Matchings and △-matroids, Discrete Math., 24 (1989), pp. 55-62.
8. A. BOUCHET, Compatible Euler tours and supplementary Eulerian vectors, European J. Cornbin., 14 (1993), pp. 513-520.
9. R. CHANDRASEKARAN AND S. N. KABADI, Pseudomatroids, Discrete Math., 71 (1988), pp. 205-217.
10. D. BÉNARD, A. BOUCHET, AND A. DUCHAMP, Tutte and Martin polynomials, submitted.
11. A. DRESS AND T. HAVEL, Some combinatorial properties of discriminants in metric vector spaces, Adv. Math., 62 (1986), pp. 285-312.
12. A. DUCHAMP, Etudes de quelques notions et propriétés relatives aux matroïdes symétriques: Axiomatiques, Extensions ponctuelles, Quotients, Représentations, Ph.D. thesis, Université du Maine, 1991.
13. A. DUCHAMP, private communication, 1993.
14. J. EDMONDS, Lehman's switching game and a theorem of Tutte and Nash-Williams, J. Res. Bur. Standards Sect. B, 69B (1965), pp. 73-77.
15. B. JACKSON, A characterization of graphs having three pairwise compatible Euler tours, J. Combin. Theory Ser. B, 53 (1991), pp. 80-92.
16. B. JACKSON, Supplementary Eulerian vectors in isotropic systems, J. Combin. Theory Ser. B, 53 (1991), pp. 93-105.
17. A. KOTZIG, private communication to B. Jackson.
18. A. KOTZIG, Eulerian lines in finite 4-valent graphs and their transformations, in Theory of Graphs, Erdös and Katona, eds., Academic Press, New York, 1968, pp. 219-230.
19. L. LOVÁSZ, The matroid matching problem, in Algebraic Methods in Graph Theory, L. Lovász and V. T. Sos, eds., North-Holland, Amsterdam, 1978, pp. 495-517.
20. C. NASH-WILLIAMS, Another proof of a theorem concerning detachments of graphs, European J. Combin., 12 (1991), pp. 245-248.
21. C. S. J. A. NASH-WILLIAMS, Acyclic detachments of graphs, in Graph Theory and Combinatorics, Open Univ., Milton Keynes, Pitman, Boston, 1979, pp. 87-97.
22. L. QI, Directed submodularity, ditroids and directed submodular flows, Math. Programming, 42 (1988), pp. 579-599.
23. D. WELSH, Matroid Theory, Academic Press, New York, 1976.