论文信息 - Edge Colorings and Circular Flow Numbers of Regular Graphs

Edge Colorings and Circular Flow Numbers of Regular Graphs

The article characterizes 2t+1-regular graphs with circular flow number 2+22t-1. For t=1 this is Tutte's characterization of cubic graphs with flow number 4. The class of cubic graphs is the only class of odd regular graphs where a flow number separates the class 1 graphs from the class 2 graphs. We finally state some conjectures and relate them to Jaeger's circular flow conjecture and Tutte's 3-flow conjecture.

Eckhard Steffen | E. Steffen

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

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

[3] F. Jaeger,et al. Balanced valuations and flows in multigraphs , 1976 .

[4] Xuding Zhu,et al. Construction of graphs with given circular flow numbers , 2003, J. Graph Theory.

[5] Eckhard Steffen,et al. Chromatic-index-critical graphs of even order , 1999, J. Graph Theory.

[6] Martin Skoviera,et al. Snarks with given real flow numbers , 2011, J. Graph Theory.

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

[8] Michael Tarsi,et al. On (k, d)-colorings and fractional nowhere-zero flows , 1998 .

[9] Michael Schubert,et al. The Set of Circular Flow Numbers of Regular Graphs , 2014, J. Graph Theory.

[10] George J. Minty,et al. A theorem on three-coloring the edges of a trivalent graph* , 1967 .

[11] R. Isaacs. Infinite Families of Nontrivial Trivalent Graphs Which are not Tait Colorable , 1975 .