Biased graphs. II: The three matroids
From MaRDI portal
Publication:1174782
DOI10.1016/0095-8956(91)90005-5zbMath0763.05096OpenAlexW2090277543MaRDI QIDQ1174782
Publication date: 25 June 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(91)90005-5
Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)
Related Items (75)
Matroids arising from electrical networks ⋮ Recognizing Even-Cycle and Even-Cut Matroids ⋮ Matrix representations of frame and lifted-graphic matroids correspond to gain functions ⋮ Enumeration of extensions of the cycle matroid of a complete graph ⋮ Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\) ⋮ Matroids of gain graphs in applied discrete geometry ⋮ Dowling group geometries and the critical problem ⋮ Representations of bicircular lift matroids ⋮ On graphic elementary lifts of graphic matroids ⋮ Packing non-zero \(A\)-paths via matroid matching ⋮ Negative (and positive) circles in signed graphs: a problem collection ⋮ Projective-planar signed graphs and tangled signed graphs ⋮ Decompositions of signed-graphic matroids ⋮ The excluded minors for the class of matroids that are graphic or bicircular lift ⋮ Bounding and stabilizing realizations of biased graphs with a fixed group ⋮ Generic Symmetry-Forced Infinitesimal Rigidity: Translations and Rotations ⋮ A Generalisation of the Matroid Lift Construction ⋮ The biased graphs whose matroids are binary ⋮ Signed analogs of bipartite graphs ⋮ When does a biased graph come from a group labelling? ⋮ 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 ⋮ On the determinant of the Laplacian matrix of a complex unit gain graph ⋮ Automorphisms of Dowling Lattices and Related Geometries ⋮ Almost balanced biased graph representations of frame matroids ⋮ Binary signed-graphic matroids: representations and recognition algorithms ⋮ On the subsemigroup complex of an aperiodic Brandt semigroup ⋮ Frame matroids, toric ideals, and a conjecture of White ⋮ Inequivalent representations of matroids over prime fields ⋮ Recognizing even-cycle and even-cut matroids ⋮ On the structure of matroids arising from the gain graphs ⋮ Graphical representations of graphic frame matroids ⋮ Matroid lifts and representability ⋮ Cluster Consensus with Point Group Symmetries ⋮ Tree automata and pigeonhole classes of matroids. II ⋮ Cobiased graphs: single-element extensions and elementary quotients of graphic matroids ⋮ On Recognizing Frame and Lifted‐Graphic Matroids ⋮ Clones in 3-connected frame matroids ⋮ The Unbreakable Frame Matroids ⋮ Modular construction of free hyperplane arrangements ⋮ A reciprocal eigenvalue property for unicyclic weighted directed graphs with weights from \(\{\pm 1,{\pm}i\}\) ⋮ A modular triple characterization of circuit signatures ⋮ Displaying blocking pairs in signed graphs ⋮ The category of matroids ⋮ On excluded minors for classes of graphical matroids ⋮ Biased graphs with no two vertex-disjoint unbalanced cycles ⋮ The signed-graphic representations of wheels and whirls ⋮ Connectivity in frame matroids ⋮ Counter machines and crystallographic structures ⋮ Lindström's conjecture on a class of algebraically non-representable matroids ⋮ Bias matroids with unique graphical representations ⋮ Fractal classes of matroids ⋮ Infinitely many excluded minors for frame matroids and for lifted-graphic matroids ⋮ On excluded minors of connectivity 2 for the class of frame matroids ⋮ Vertices of Localized Imbalance in a Biased Graph ⋮ Linear codes over signed graphs ⋮ Excluding a group-labelled graph ⋮ Totally frustrated states in the chromatic theory of gain graphs ⋮ On the Falk invariant of Shi and linial arrangements ⋮ Describing quasi-graphic matroids ⋮ Biased graphs. I: Bias, balance, and gains ⋮ Biased graphs whose matroids are special binary matroids ⋮ A q-queens problem. VI. The bishops' period ⋮ Harmonic conjugation in harmonic matroids ⋮ The family of bicircular matroids closed under duality ⋮ A new matroid lift construction and an application to group-labeled graphs ⋮ Biased graphs. VI: Synthetic geometry ⋮ Infinitesimal Rigidity of Symmetric Bar-Joint Frameworks ⋮ Recent work in matroid representation theory ⋮ On cographic matroids and signed-graphic matroids ⋮ Unavoidable minors of large 4-connected bicircular matroids ⋮ The highly connected matroids in minor-closed classes ⋮ On the Falk invariant of hyperplane arrangements attached to gain graphs ⋮ Gain-sparsity and symmetry-forced rigidity in the plane
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Biased graphs. I: Bias, balance, and gains
- Connectivity in bicircular matroids
- The biased graphs whose matroids are binary
- Signed graphs
- On matroids on edge sets of graphs with connected subgraphs as circuits. II
- Infinite graphs and bicircular matroids
- Matroids from directed graphs
- Biased graphs IV: Geometrical realizations
- Biased graphs whose matroids are special binary matroids
- Biased graphs. III: Chromatic and dichromatic invariants
- On subgraphs as matroid cells
- An interrelation between line graphs, eigenvalues, and matroids
- A class of geometric lattices based on finite groups
- BICIRCULAR GEOMETRY AND THE LATTICE OF FORESTS OF A GRAPH
- Varieties of Combinatorial Geometries
- BICIRCULAR MATROIDS
- A Combinatorial Model for Series-Parallel Networks
- Theory of Matroids
This page was built for publication: Biased graphs. II: The three matroids