Abstract. We completely describe the structure of irreducible integral flows on a signed graph by lifting them to the signed double covering graph. A (real-valued) flow (sometimes also called a circulation) on a graph or a signed graph (a graph with signed edges) is a real-valued function on oriented edges, f: � E → R, such that the net inflow to any vertex is zero. An integral flow is a flow whose values are integers. There are many reasons to be interested in flows on graphs; an important one is their relationship to graph structure through the analysis of irreducible flows, that is, integral flows that cannot be decomposed as the sum of other flows of lesser value. It is well known, and an important observation in the thoery of integral...
The work in Chapter 2 is motivated by Tutte and Jaeger\u27s pioneering work on converting modulo flo...
This paper is devoted to a detailed study of nowhere-zero flows on signed eulerian graphs. We genera...
AbstractAn orientation of a graph is acyclic (totally cyclic) if and only if it is a “positive orien...
A signed circuit is a minimal signed graph (with respect to inclusion) that admits a nowhere-zero fl...
Abstract. A nowhere-zero k-flow on a graph Γ is a mapping from the edges of Γ to the set {±1, ±2,......
AbstractA nowhere-zero k-flow on a graph Γ is a mapping from the edges of Γ to the set {±1,±2,…,±(k−...
The fundamental concepts of graph theory are cycles, Eulerian graphs, bonds, cuts, spanning trees an...
Shrnujeme známé výsledky týkající se nenulových toků a souvisejících témat, jako je pokrytí kružnice...
The presented paper studies the flow number F(G, σ) of flow-admissible signed graphs (G, σ) with two...
AbstractIt is proved that every bidirected graph which can be provided with a nowhere-zero integral ...
My research focuses on two famous problems in graph theory, namely the cycle double cover conjecture...
AbstractThe circular flow number Φc(G,σ) of a signed graph (G,σ) is the minimum r for which an orien...
A flow network N is a capacited finite directed graph, with multiple input ports/arcs and multiple o...
This paper is to introduce circuit, bond, flow, and tension spaces and lattices for signed graphs, a...
This note gives a very brief introduction to the theory of network flows and some related topics in ...
The work in Chapter 2 is motivated by Tutte and Jaeger\u27s pioneering work on converting modulo flo...
This paper is devoted to a detailed study of nowhere-zero flows on signed eulerian graphs. We genera...
AbstractAn orientation of a graph is acyclic (totally cyclic) if and only if it is a “positive orien...
A signed circuit is a minimal signed graph (with respect to inclusion) that admits a nowhere-zero fl...
Abstract. A nowhere-zero k-flow on a graph Γ is a mapping from the edges of Γ to the set {±1, ±2,......
AbstractA nowhere-zero k-flow on a graph Γ is a mapping from the edges of Γ to the set {±1,±2,…,±(k−...
The fundamental concepts of graph theory are cycles, Eulerian graphs, bonds, cuts, spanning trees an...
Shrnujeme známé výsledky týkající se nenulových toků a souvisejících témat, jako je pokrytí kružnice...
The presented paper studies the flow number F(G, σ) of flow-admissible signed graphs (G, σ) with two...
AbstractIt is proved that every bidirected graph which can be provided with a nowhere-zero integral ...
My research focuses on two famous problems in graph theory, namely the cycle double cover conjecture...
AbstractThe circular flow number Φc(G,σ) of a signed graph (G,σ) is the minimum r for which an orien...
A flow network N is a capacited finite directed graph, with multiple input ports/arcs and multiple o...
This paper is to introduce circuit, bond, flow, and tension spaces and lattices for signed graphs, a...
This note gives a very brief introduction to the theory of network flows and some related topics in ...
The work in Chapter 2 is motivated by Tutte and Jaeger\u27s pioneering work on converting modulo flo...
This paper is devoted to a detailed study of nowhere-zero flows on signed eulerian graphs. We genera...
AbstractAn orientation of a graph is acyclic (totally cyclic) if and only if it is a “positive orien...