Multimatroids. III: Tightness and fundamental graphs

DOI10.1006/EUJC.2000.0486zbMATH Open0982.05034OpenAlexW1972360724MaRDI QIDQ5944005FDOQ5944005

Authors: 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

Recommendations

• Multimatroids. II: Orthogonality, minors and connectivity
• Inductive tools for connected delta-matroids and multimatroids
• Orienting transversals and transition polynomials of multimatroids
• Interlace polynomials for multimatroids and delta-matroids
• Multimatroids I. Coverings by Independent Sets

zbMATH Keywords

connectivitymultimatroidsdelta-matroidsEulerian 2-matroidsEulerian 3-matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

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

Cited In (23)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5944005)