Bounding and stabilizing realizations of biased graphs with a fixed group
From MaRDI portal
Publication:345077
Recommendations
Cites work
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- A Combinatorial Decomposition Theory
- A simple theorem on 3-connectivity
- Biased graphs. I: Bias, balance, and gains
- Biased graphs. II: The three matroids
- Biased graphs. VII: Contrabalance and antivoltages
- Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\)
- Frame matroids and biased graphs
- Inequivalent representations of matroids over prime fields
- Matroid Duality from Topological Duality in Surfaces of Nonnegative Euler Characteristic
- Minors of 3-connected matroids
- On cographic matroids and signed-graphic matroids
- On inequivalent representations of matroids over non-prime fields
- On the Uniqueness of Matroid Representations Over GF(4)
- Solving Rota's conjecture
- Stabilizers of classes of representable matroids
- The highly connected matroids in minor-closed classes
- Typical subgraphs of 3- and 4-connected graphs
- Varieties of Combinatorial Geometries
Cited in
(2)
This page was built for publication: Bounding and stabilizing realizations of biased graphs with a fixed group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q345077)