Bounding and stabilizing realizations of biased graphs with a fixed group
From MaRDI portal
Publication:345077
DOI10.1016/J.JCTB.2016.05.008zbMATH Open1350.05073OpenAlexW2437427058MaRDI QIDQ345077FDOQ345077
Authors: Nancy Ann Neudauer, Daniel Slilaty
Publication date: 25 November 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2016.05.008
Recommendations
Combinatorial aspects of matroids and geometric lattices (05B35) Paths and cycles (05C38) Graph minors (05C83)
Cites Work
- Frame matroids and biased graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Biased graphs. I: Bias, balance, and gains
- Typical subgraphs of 3- and 4-connected graphs
- Biased graphs. II: The three matroids
- A Combinatorial Decomposition Theory
- The highly connected matroids in minor-closed classes
- Biased graphs. VII: Contrabalance and antivoltages
- Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\)
- Varieties of Combinatorial Geometries
- A simple theorem on 3-connectivity
- Minors of 3-connected matroids
- Stabilizers of classes of representable matroids
- On cographic matroids and signed-graphic matroids
- Solving Rota's conjecture
- On the Uniqueness of Matroid Representations Over GF(4)
- Inequivalent representations of matroids over prime fields
- Matroid Duality from Topological Duality in Surfaces of Nonnegative Euler Characteristic
- On inequivalent representations of matroids over non-prime fields
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)