Delta matroids whose fundamental graphs are bipartite

DOI10.1016/0024-3795(92)90441-CzbMath0749.05025OpenAlexW2084146259MaRDI QIDQ1183130

Alain Duchamp

Publication date: 28 June 1992

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(92)90441-c

zbMATH Keywords

exchange axiomfundamental graphsdelta matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (5)

Circuit separation for symmetric matroids ⋮ Signed permutohedra, delta‐matroids, and beyond ⋮ Characterizing matroids whose bases form graphic delta-matroids ⋮ Matroids, delta-matroids and embedded graphs ⋮ Irreducibility of the Tutte polynomial of an embedded graph

Cites Work

• Matchings and \(\Delta\)-matroids
• Some combinatorial properties of discriminants in metric vector spaces
• Pseudomatroids
• Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
• Greedy algorithm and symmetric matroids
• Lectures on matroids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Delta matroids whose fundamental graphs are bipartite