Nowhere-zero flows on signed regular graphs

We study the flow spectrum S ( G ) and the integer flow spectrum S ? ( G ) of signed ( 2 t + 1 ) -regular graphs. We show that if r ? S ( G ) , then r = 2 + 1 t or r ? 2 + 2 2 t - 1 . Furthermore, 2 + 1 t ? S ( G ) if and only if G has a t -factor. If G has a 1-factor, then 3 ? S ? ( G ) , and for every t ? 2 , there is a signed ( 2 t + 1 ) -regular graph ( H , ? ) with 3 ? S ? ( H ) and H does not have a 1-factor.If G ( ? K 2 3 ) is a cubic graph which has a 1-factor, then { 3 , 4 } ? S ( G ) ? S ? ( G ) . Furthermore, the following four statements are equivalent: (1) G has a 1-factor. (2) 3 ? S ( G ) . (3) 3 ? S ? ( G ) . (4) 4 ? S ? ( G ) . There are cubic graphs whose integer flow spectrum does not contain 5 or 6, and we construct an infinite family of bridgeless cubic graphs with integer flow spectrum { 3 , 4 , 6 } .We show that there are signed graphs where the difference between the integer flow number and the flow number is greater than or equal to 1, disproving a conjecture of Raspaud and Zhu.The paper concludes with a proof of Bouchet's 6-flow conjecture for Kotzig-graphs.

[1]  André Bouchet,et al.  Nowhere-zero integral flows on a bidirected graph , 1983, J. Comb. Theory B.

[2]  André Raspaud,et al.  Circular flow on signed graphs , 2011, J. Comb. Theory, Ser. B.

[3]  W. T. Tutte,et al.  On the Imbedding of Linear Graphs in Surfaces , 1949 .

[4]  Eckhard Steffen,et al.  Classifications and characterizations of snarks , 1998, Discret. Math..

[5]  Cun-Quan Zhang Circuit Double Covers of Graphs , 2012 .

[6]  Edita Mácajová,et al.  Nowhere-Zero Flows on Signed Eulerian Graphs , 2017, SIAM J. Discret. Math..

[7]  Edita Mácajová,et al.  On the flow numbers of signed complete and complete bipartite graphs , 2011, Electron. Notes Discret. Math..

[8]  J. Petersen Die Theorie der regulären graphs , 1891 .

[9]  Paul D. Seymour,et al.  Nowhere-zero 6-flows , 1981, J. Comb. Theory, Ser. B.

[10]  Jin Akiyama,et al.  Factors and Factorizations of Graphs , 2011 .

[11]  H. V. Kronk,et al.  Uniquely Line Colorable Graphs , 1973, Canadian Mathematical Bulletin.

[12]  W. T. Tutte,et al.  A Contribution to the Theory of Chromatic Polynomials , 1954, Canadian Journal of Mathematics.

[13]  Eckhard Steffen Circular flow numbers of regular multigraphs , 2001, J. Graph Theory.

[14]  Rui Xu,et al.  On flows in bidirected graphs , 2005, Discret. Math..

[15]  Eckhard Steffen Measurements of edge-uncolorability , 2004, Discret. Math..