Resolution of indecomposable integral flows on signed graphs
DOI10.1016/j.disc.2016.12.013zbMath1369.05098arXiv1701.04494OpenAlexW2579128960MaRDI QIDQ2400559
Jue Wang, Beifang Chen, Thomas Zaslavsky
Publication date: 29 August 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.04494
signed graphdouble covering graphindecomposable integral flowprime sesqui-Eulerian signed graphsesqui-Eulerian circle-treesesqui-Eulerian signed graph
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Signed and weighted graphs (05C22)
Related Items (max. 100)
Cites Work
- Torsion formulas for signed graphs
- Biased graphs. I: Bias, balance, and gains
- Nowhere-zero integral flows on a bidirected graph
- Signed graphs
- Orientation of signed graphs
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Packing odd circuits in Eulerian graphs
- The flow and tension spaces and lattices of signed graphs
- Matrices in the Theory of Signed Simple Graphs
- Bracing Rectangular Frameworks. II
- A bidirected generalization of network matrices
- A simple algorithm that proves half‐integrality of bidirected network programming
- Maximum matching and a polyhedron with 0,1-vertices
This page was built for publication: Resolution of indecomposable integral flows on signed graphs