Cobiased graphs: single-element extensions and elementary quotients of graphic matroids

DOI10.37236/12148arXiv2401.17616MaRDI QIDQ6194253

Daniel C. Slilaty, Thomas Zaslavsky

Publication date: 19 March 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2401.17616

zbMATH Keywords

biased graphquotients of graphic matroids

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Signed and weighted graphs (05C22)

Cites Work

• Biased graphs. I: Bias, balance, and gains
• Elementary strong maps of graphic matroids
• Decomposition of regular matroids
• Biased graphs. II: The three matroids
• Elementary strong maps of graphic matroids. II
• \(q\)-ary graphical codes
• Relationships between Pairs of Representations of Signed Binary Matroids
• Single-element extensions of matroids
• Graph theoretic error-correcting codes
• Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids
• Unnamed Item

This page was built for publication: Cobiased graphs: single-element extensions and elementary quotients of graphic matroids