Bounding and stabilizing realizations of biased graphs with a fixed group

DOI10.1016/j.jctb.2016.05.008zbMath1350.05073OpenAlexW2437427058MaRDI QIDQ345077

Nancy Ann Neudauer, Daniel C. 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

zbMATH Keywords

gain graphbiased graphgroup realization

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83)

Related Items (1)

The graphs that have antivoltages using groups of small order

Cites Work

• Unnamed Item
• Unnamed Item
• Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\)
• Inequivalent representations of matroids over prime fields
• On inequivalent representations of matroids over non-prime fields
• Biased graphs. I: Bias, balance, and gains
• Typical subgraphs of 3- and 4-connected graphs
• Minors of 3-connected matroids
• A simple theorem on 3-connectivity
• Biased graphs. II: The three matroids
• Frame matroids and biased graphs
• Stabilizers of classes of representable matroids
• The highly connected matroids in minor-closed classes
• Biased graphs. VII: Contrabalance and antivoltages
• On cographic matroids and signed-graphic matroids
• Solving Rota's Conjecture
• On the Uniqueness of Matroid Representations Over GF(4)
• A Combinatorial Decomposition Theory
• Varieties of Combinatorial Geometries
• Matroid Duality from Topological Duality in Surfaces of Nonnegative Euler Characteristic

This page was built for publication: Bounding and stabilizing realizations of biased graphs with a fixed group