Frame matroids and biased graphs
From MaRDI portal
Recommendations
Cited in
(28)- On excluded minors for classes of graphical matroids
- Almost balanced biased graph representations of frame matroids
- Infinitely many excluded minors for frame matroids and for lifted-graphic matroids
- Projective planarity of matroids of 3-nets and biased graphs
- Bounding and stabilizing realizations of biased graphs with a fixed group
- Clones in 3-connected frame matroids
- Describing quasi-graphic matroids
- A short proof of Shih's isomorphism theorem on graphic subspaces
- Matroids of gain graphs in applied discrete geometry
- Characterizing bias matroids
- Tutte's dichromate for signed graphs
- Biased graphs. VI: Synthetic geometry
- Strong algorithms for the ordinal matroid secretary problem
- Biased graphs IV: Geometrical realizations
- Supersolvable frame-matroid and graphic-lift lattices
- When does a biased graph come from a group labelling?
- Restricted frame graphs and a conjecture of Scott
- Varieties and universal models in the theory of combinatorial geometries
- On excluded minors of connectivity 2 for the class of frame matroids
- Biased graphs. VII: Contrabalance and antivoltages
- Connectivity in frame matroids
- Matrix representations of frame and lifted-graphic matroids correspond to gain functions
- The biased graphs whose matroids are binary
- Biased expansions of biased graphs and their chromatic polynomials
- Graphical representations of graphic frame matroids
- Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\)
- Representability of matroids by \(c\)-arrangements is undecidable
- Excluding a line from complex-representable matroids
This page was built for publication: Frame matroids and biased graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329081)