Multimatroids I. Coverings by Independent Sets

@article{Bouchet1997MultimatroidsIC,
  title={Multimatroids I. Coverings by Independent Sets},
  author={Andr{\'e} Bouchet},
  journal={SIAM J. Discrete Math.},
  year={1997},
  volume={10},
  pages={626-646}
}
Multimatroids are combinatorial structures that generalize matroids and arise in the study of Eulerian graphs. We prove, by means of an efficient algorithm, a covering theorem for multimatroids. This theorem extends Edmonds’ covering theorem for matroids. It also generalizes a theorem of Jackson on the Euler tours of a 4-regular graph. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

A characterization of graphs having three pairwise compatible Euler tours

  • B. Jackson
  • J. Combin. Theory Ser. B, 53
  • 1991
3 Excerpts

Directed submodularity

  • L. Qi
  • ditroids and directed submodular flows, Math…
  • 1988
1 Excerpt

Pseudomatroids

  • R. Chandrasekaran, S. N. Kabadi
  • Discrete Math., 71
  • 1988
1 Excerpt

Similar Papers

Loading similar papers…