We represent a flow of a graph G=(V,E) as a couple (C,e) with C a circuit of G and e an edge of C, and its incidence vector is the 0 15\ub11 vector \u3c7C 16e 12\u3c7e. The flow cone of G is the cone generated by the flows of G and the unit vectors. When G has no K5-minor, this cone can be described by the system x(M) 650 for all multicuts M of G. We prove that this system is box-totally dual integral if and only if G is series\u2013parallel. Then, we refine this result to provide the Schrijver system describing the flow cone in series\u2013parallel graphs. This answers a question raised by Chervet et al., (2018)
Abstract. We completely describe the structure of irreducible integral flows on a signed graph by li...
AbstractSuppose that G = (VG, EG) is a planar graph embedded in the euclidean plane, that I, J, K, O...
We introduce , double-struck Iâ a sound and complete graphical theory of vector subspaces over the f...
Let G be a graph and let A be its cutset-edge incidence matrix. We prove that the linear system frac...
AbstractLet G be a graph and let A be its cutset-edge incidence matrix. We prove that the linear sys...
Series–parallel graphs are known to be precisely the graphs for which the standard linear systems de...
Let $G=(V,E)$ be a finite acyclic directed graph. Being motivated by a study of certain aspects of c...
Given a graph G = (V, E) and an integer k >= 1, the graph H = (V, F), where F is a family of elem...
Given a connected graph G=(V,E) and an integer (formula presented), the connected graph H=(V,F) wher...
R. China Using the decomposition theory of modular and integral flow polynomials, we answer a proble...
AbstractIn this paper, some earlier results by Fleischner [H. Fleischner, Bipartizing matchings and ...
AbstractWe show if the flow polynomial of a bridgeless graph G has only integral roots, then G is th...
A classical flow is a nonnegative linear combination of unit flows along simple paths. A multiroute ...
AbstractUsing the decomposition theory of modular and integral flow polynomials, we answer a problem...
Edmonds and Giles introduced the class of box totally dual integral polyhedra as a generalization of...
Abstract. We completely describe the structure of irreducible integral flows on a signed graph by li...
AbstractSuppose that G = (VG, EG) is a planar graph embedded in the euclidean plane, that I, J, K, O...
We introduce , double-struck Iâ a sound and complete graphical theory of vector subspaces over the f...
Let G be a graph and let A be its cutset-edge incidence matrix. We prove that the linear system frac...
AbstractLet G be a graph and let A be its cutset-edge incidence matrix. We prove that the linear sys...
Series–parallel graphs are known to be precisely the graphs for which the standard linear systems de...
Let $G=(V,E)$ be a finite acyclic directed graph. Being motivated by a study of certain aspects of c...
Given a graph G = (V, E) and an integer k >= 1, the graph H = (V, F), where F is a family of elem...
Given a connected graph G=(V,E) and an integer (formula presented), the connected graph H=(V,F) wher...
R. China Using the decomposition theory of modular and integral flow polynomials, we answer a proble...
AbstractIn this paper, some earlier results by Fleischner [H. Fleischner, Bipartizing matchings and ...
AbstractWe show if the flow polynomial of a bridgeless graph G has only integral roots, then G is th...
A classical flow is a nonnegative linear combination of unit flows along simple paths. A multiroute ...
AbstractUsing the decomposition theory of modular and integral flow polynomials, we answer a problem...
Edmonds and Giles introduced the class of box totally dual integral polyhedra as a generalization of...
Abstract. We completely describe the structure of irreducible integral flows on a signed graph by li...
AbstractSuppose that G = (VG, EG) is a planar graph embedded in the euclidean plane, that I, J, K, O...
We introduce , double-struck Iâ a sound and complete graphical theory of vector subspaces over the f...