Symmetric matroids are set systems which are obtained, in some sense, by a weakening of the structure of a matroid. These set systems are characterized by a greedy algorithm and they are suitable for dealing with autodual properties of matroids. Applications are given to the eulerian tours of 4-regular graphs and the theory ofg-matroids.
Key wordsMatroid greedy algorithm Euler tour 4-regular graph
Unable to display preview. Download preview PDF.
- A. Bouchet, “Isotropic systems,” to appear inEuropean Journal of Combinatorics.Google Scholar
- A. Bouchet, “Graphic presentations of isotropic systems,” submitted.Google Scholar
- B. Korte and L. Lovàsz, “Greedoids, a structural framework for the greedy algorithm,” in “Progress in Combinatorial Optimization” in: W.R. Pulleyblank, ed., Proceedings of the Silver Jubilee Conference on Combinatorics, Waterloo, June 1982, (Academic Press, London/New York/San Francisco, 1984) pp. 221–243.Google Scholar
- A. Kotzig, “Eulerian lines in finite 4-valent graphs and their transformations,” in: Erdòs and Katona, eds,Theory of Graphs., Proceedings of the Colloquium held at Tihany (Hungary), Sept. 1966 (North-Holland, Amsterdam, 1968) pp. 219–230.Google Scholar
- A. Schultze, personal communication, Oct. 1985.Google Scholar
- E. Tardòs, “Generalized matroids,” to appear.Google Scholar