Biased graphs. II: The three matroids
From MaRDI portal
Recommendations
Cites work
- A class of geometric lattices based on finite groups
- A Combinatorial Model for Series-Parallel Networks
- An interrelation between line graphs, eigenvalues, and matroids
- Biased graphs IV: Geometrical realizations
- Biased graphs whose matroids are special binary matroids
- Biased graphs. I: Bias, balance, and gains
- Biased graphs. III: Chromatic and dichromatic invariants
- BICIRCULAR GEOMETRY AND THE LATTICE OF FORESTS OF A GRAPH
- BICIRCULAR MATROIDS
- Connectivity in bicircular matroids
- scientific article; zbMATH DE number 3959442 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3666528 (Why is no real title available?)
- scientific article; zbMATH DE number 3465315 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3557809 (Why is no real title available?)
- scientific article; zbMATH DE number 3243269 (Why is no real title available?)
- scientific article; zbMATH DE number 3311634 (Why is no real title available?)
- scientific article; zbMATH DE number 3342868 (Why is no real title available?)
- scientific article; zbMATH DE number 3363579 (Why is no real title available?)
- scientific article; zbMATH DE number 3368642 (Why is no real title available?)
- scientific article; zbMATH DE number 3409373 (Why is no real title available?)
- Infinite graphs and bicircular matroids
- Matroids from directed graphs
- On matroids on edge sets of graphs with connected subgraphs as circuits. II
- On subgraphs as matroid cells
- Signed graphs
- The biased graphs whose matroids are binary
- Theory of Matroids
- Varieties of Combinatorial Geometries
Cited in
(92)- Harmonic conjugation in harmonic matroids
- Dowling group geometries and the critical problem
- The biased graphs whose matroids are binary
- Characterizing bias matroids
- Frame matroids and biased graphs
- Signed analogs of bipartite graphs
- Biased graphs IV: Geometrical realizations
- Negative (and positive) circles in signed graphs: a problem collection
- The category of matroids
- On excluded minors for classes of graphical matroids
- Biased graphs with no two vertex-disjoint unbalanced cycles
- Infinitely many excluded minors for frame matroids and for lifted-graphic matroids
- Biased graphs whose matroids are special binary matroids
- Supersolvable frame-matroid and graphic-lift lattices
- Biased graphs. III: Chromatic and dichromatic invariants
- Biased expansions of biased graphs and their chromatic polynomials
- Counter machines and crystallographic structures
- Fractal classes of matroids
- On the Falk invariant of Shi and linial arrangements
- The family of bicircular matroids closed under duality
- A new matroid lift construction and an application to group-labeled graphs
- Matroids arising from electrical networks
- Matrix representations of frame and lifted-graphic matroids correspond to gain functions
- Enumeration of extensions of the cycle matroid of a complete graph
- On graphic elementary lifts of graphic matroids
- Binary signed-graphic matroids: representations and recognition algorithms
- Frame matroids, toric ideals, and a conjecture of White
- Modular construction of free hyperplane arrangements
- Linear codes over signed graphs
- Describing quasi-graphic matroids
- Biased graphs. VI: Synthetic geometry
- Unavoidable minors of large 4-connected bicircular matroids
- The highly connected matroids in minor-closed classes
- Biased graphs. VII: Contrabalance and antivoltages
- When does a biased graph come from a group labelling?
- On the determinant of the Laplacian matrix of a complex unit gain graph
- Almost balanced biased graph representations of frame matroids
- On the subsemigroup complex of an aperiodic Brandt semigroup
- A reciprocal eigenvalue property for unicyclic weighted directed graphs with weights from \(\{\pm 1,{\pm}i\}\)
- A modular triple characterization of circuit signatures
- Lindström's conjecture on a class of algebraically non-representable matroids
- Bias matroids with unique graphical representations
- Excluding a group-labelled graph
- Totally frustrated states in the chromatic theory of gain graphs
- Recent work in matroid representation theory
- On cographic matroids and signed-graphic matroids
- Gain-sparsity and symmetry-forced rigidity in the plane
- Projective-planar signed graphs and tangled signed graphs
- Decompositions of signed-graphic matroids
- A short proof of Shih's isomorphism theorem on graphic subspaces
- On characterizing the class of cographic signed-graphic matroids
- On the Dowling and Rhodes lattices and wreath products
- Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\)
- Representations of bicircular lift matroids
- Packing non-zero \(A\)-paths via matroid matching
- On the Falk invariant of hyperplane arrangements attached to gain graphs
- The excluded minors for the class of matroids that are graphic or bicircular lift
- Matroids of gain graphs in applied discrete geometry
- Bounding and stabilizing realizations of biased graphs with a fixed group
- Vertices of Localized Imbalance in a Biased Graph
- Inequivalent representations of matroids over prime fields
- Cluster consensus with point group symmetries
- On recognizing frame and lifted-graphic matroids
- A Generalisation of the Matroid Lift Construction
- Automorphisms of Dowling Lattices and Related Geometries
- Displaying blocking pairs in signed graphs
- Recognizing Even-Cycle and Even-Cut Matroids
- Generic symmetry-forced infinitesimal rigidity: translations and rotations
- Projective planarity of matroids of 3-nets and biased graphs
- The unbreakable frame matroids
- A \(q\)-queens problem. VI. The bishops' period
- Infinitesimal rigidity of symmetric bar-joint frameworks
- Recognizing even-cycle and even-cut matroids
- On the structure of matroids arising from the gain graphs
- Matroid lifts and representability
- Tree automata and pigeonhole classes of matroids. II
- Cobiased graphs: single-element extensions and elementary quotients of graphic matroids
- Decomposition of quaternary signed-graphic matroids
- Matroids of gain signed graphs
- The Rhodes semilattice of a biased graph
- Excluding a line from complex-representable matroids
- Orientations of single-element extensions of graphic matroids
- The determinant of the adjacency matrix of a quaternion unit gain graph
- A mathematical programming approach for recognizing binet matrices
- On entropic and almost multilinear representability of matroids
- On excluded minors of connectivity 2 for the class of frame matroids
- Biased graphs. I: Bias, balance, and gains
- An Orlik-Solomon type algebra for matroids with a fixed linear class of circuits
- Graphical representations of graphic frame matroids
- Clones in 3-connected frame matroids
- The signed-graphic representations of wheels and whirls
- Connectivity in frame matroids
This page was built for publication: Biased graphs. II: The three matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1174782)
