Multimatroids. III: Tightness and fundamental graphs

DOI10.1006/eujc.2000.0486zbMath0982.05034OpenAlexW1972360724MaRDI QIDQ5944005

André Bouchet

Publication date: 8 April 2002

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2000.0486

zbMATH Keywords

connectivitydelta-matroidsEulerian 2-matroidsEulerian 3-matroidsmultimatroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (22)

A BRACKET POLYNOMIAL FOR GRAPHS, IV: UNDIRECTED EULER CIRCUITS, GRAPH-LINKS AND MULTIPLY MARKED GRAPHS ⋮ Interlace polynomials for multimatroids and delta-matroids ⋮ From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals ⋮ Interlacement and activities in delta-matroids ⋮ Recombination faults in gene assembly in ciliates modeled using multimatroids ⋮ Nullity invariance for pivot and the interlace polynomial ⋮ The group structure of pivot and loop complementation on graphs and set systems ⋮ On the linear algebra of local complementation ⋮ Weighted Interlace Polynomials ⋮ A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS ⋮ Orienting transversals and transition polynomials of multimatroids ⋮ The excluded 3-minors for vf-safe delta-matroids ⋮ Isotropic matroids. I: Multimatroids and neighborhoods ⋮ Isotropic matroids. II: Circle graphs ⋮ A characterization of circle graphs in terms of multimatroid representations ⋮ Half-integrality, LP-branching, and FPT Algorithms ⋮ Matroids, delta-matroids and embedded graphs ⋮ A BRACKET POLYNOMIAL FOR GRAPHS, I ⋮ Graph polynomials derived from Tutte-Martin polynomials ⋮ Multimatroids. IV: Chain-group representations ⋮ Irreducibility of the Tutte polynomial of an embedded graph ⋮ Inductive tools for connected delta-matroids and multimatroids

Cites Work

• Matchings and \(\Delta\)-matroids
• Isotropic systems
• Graphic presentations of isotropic systems
• The dependence graph for bases in matroids
• Principally unimodular skew-symmetric matrices
• Circle graph obstructions
• Multimatroids. II: Orthogonality, minors and connectivity
• Maps and \(\Delta\)-matroids
• Greedy algorithm and symmetric matroids
• Multimatroids I. Coverings by Independent Sets
• Coverings and delta-coverings
• Connectivity in Matroids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Multimatroids. III: Tightness and fundamental graphs