Matroids of gain signed graphs
From MaRDI portal
Publication:6624166
DOI10.1007/S00454-023-00568-ZMaRDI QIDQ6624166
Thomas Zaslavsky, Ting Su, Laura Anderson
Publication date: 25 October 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
matroidedge polytopeaffinographic hyperplane arrangementadjacency polytopeabelian gain signed grapharc polytope
Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial aspects of matroids and geometric lattices (05B35) Signed and weighted graphs (05C22)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Shi threshold arrangement
- Roots of Ehrhart polynomials arising from graphs
- Biased graphs. I: Bias, balance, and gains
- On geometric semilattices
- Signed graphs
- Signed graph coloring
- Erratum to: T. Zaslavsky, signed graphs
- Biased graphs. II: The three matroids
- Orientation of signed graphs
- Normal polytopes arising from finite graphs
- Biased graphs IV: Geometrical realizations
- Perpendicular dissections of space
- Biased graphs. III: Chromatic and dichromatic invariants
- An elementary chromatic reduction for gain graphs and special hyperplane arrangements
- Characteristic polynomials of subspace arrangements and finite fields
- Facets and facet subgraphs of symmetric edge polytopes
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Enumeration of Graphs and the Characteristic Polynomial of the Hyperplane Arrangements $\mathcal{J}_n$
- ON CERTAIN HYPERPLANE ARRANGEMENTS AND COLORED GRAPHS
- A simple algorithm that proves half‐integrality of bidirected network programming
This page was built for publication: Matroids of gain signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624166)
