A note on counting flows in signed graphs
From MaRDI portal
Publication:2420566
zbMath1441.05096arXiv1701.07369MaRDI QIDQ2420566
Robert Šámal, Matt DeVos, Edita Rollová
Publication date: 6 June 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.07369
Graph polynomials (05C31) Enumeration in graph theory (05C30) Signed and weighted graphs (05C22) Flows in graphs (05C21)
Related Items (1)
Cites Work
- Unnamed Item
- The number of nowhere-zero flows on graphs and signed graphs
- Nowhere-zero integral flows on a bidirected graph
- Polynomials associated with nowhere-zero flows
- Orbit-counting polynomials for graphs and codes
- A Bijective Proof for a Theorem of Ehrhart
- Characterizations of signed graphs
- On the Imbedding of Linear Graphs in Surfaces
- A Contribution to the Theory of Chromatic Polynomials
This page was built for publication: A note on counting flows in signed graphs