Jan 12, 2017 · As an application, we prove several results on flows in highly edge-connected graphs, extending known results. For instance, assume that p\ge 3 ...

In this paper, we prove that if an 8-edge-connected signed graph admits a nowhere-zero integer flow, then it has a nowhere-zero 3-flow. Our result extends ...

As an application, we prove several results on flows in highly edge-connected graphs, extending known results. For instance, assume that p ⩾ 3 is a prime number ...

As an application, we prove several results on flows in highly edge-connected graphs, extending known results. For instance, assume that p≥3 is a prime number ...

Keywords: Nowhere-zero flows, additive bases, edge-connectivity. 1 Introduction. Graphs considered in this paper may have multiple edges but no loops. An.

Abstract. It was conjectured by Jaeger et al. in 1992 that for any prime number p, there is a constant c such that for any n, the union (with repetition) of ...

Feb 7, 2018 · We will also need the following result of Thomassen [20], which is a simple consequence of Theorem 6. Page 9. ADDITIVE BASES AND FLOWS IN GRAPHS.

As an application, we prove several results on flows in highly edge-connected graphs, extending known results. For instance, assume that p geqslant 3 is a prime ...

Jan 12, 2017 · This paper proves the conjecture that for any prime number p, the union (with repetition) of the vectors of any family of $c$ linear bases ...

As an application, we prove several results on flows in highly edge-connected graphs, extending known results. For instance, assume that $p\ge 3$ is a prime ...