Frame matroids and biased graphs
From MaRDI portal
Publication:1329081
DOI10.1006/eujc.1994.1034zbMath0797.05027OpenAlexW2068081829WikidataQ56209780 ScholiaQ56209780MaRDI QIDQ1329081
Publication date: 10 October 1994
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1994.1034
Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Matrix representations of frame and lifted-graphic matroids correspond to gain functions ⋮ Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\) ⋮ Matroids of gain graphs in applied discrete geometry ⋮ Biased graphs. VII: Contrabalance and antivoltages ⋮ Bounding and stabilizing realizations of biased graphs with a fixed group ⋮ When does a biased graph come from a group labelling? ⋮ A short proof of Shih's isomorphism theorem on graphic subspaces ⋮ Almost balanced biased graph representations of frame matroids ⋮ Biased expansions of biased graphs and their chromatic polynomials ⋮ Graphical representations of graphic frame matroids ⋮ Representability of matroids by \(c\)-arrangements is undecidable ⋮ Biased graphs IV: Geometrical realizations ⋮ Tutte's dichromate for signed graphs ⋮ On excluded minors for classes of graphical 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 ⋮ Describing quasi-graphic matroids ⋮ Biased graphs. VI: Synthetic geometry ⋮ Varieties and universal models in the theory of combinatorial geometries ⋮ Supersolvable frame-matroid and graphic-lift lattices ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem
