Matroids of gain signed graphs
From MaRDI portal
Publication:6624166
Recommendations
Cites work
- scientific article; zbMATH DE number 6670059 (Why is no real title available?)
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 52944 (Why is no real title available?)
- scientific article; zbMATH DE number 3604927 (Why is no real title available?)
- scientific article; zbMATH DE number 3244470 (Why is no real title available?)
- A simple algorithm that proves half‐integrality of bidirected network programming
- An elementary chromatic reduction for gain graphs and special hyperplane arrangements
- Biased graphs IV: Geometrical realizations
- Biased graphs. I: Bias, balance, and gains
- Biased graphs. II: The three matroids
- Biased graphs. III: Chromatic and dichromatic invariants
- Characteristic polynomial of the hyperplane arrangements \(\mathcal{J}_n\) via finite field method
- Characteristic polynomials of subspace arrangements and finite fields
- Enumeration of Graphs and the Characteristic Polynomial of the Hyperplane Arrangements $\mathcal{J}_n$
- Erratum to: T. Zaslavsky, signed graphs
- Facets and facet subgraphs of symmetric edge polytopes
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Normal polytopes arising from finite graphs
- On certain hyperplane arrangements and colored graphs
- On geometric semilattices
- Orientation of signed graphs
- Perpendicular dissections of space
- Roots of Ehrhart polynomials arising from graphs
- Semimatroids and their Tutte polynomials
- Shi threshold arrangement
- Signed graph coloring
- Signed graphs
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)