论文信息 - On the Number of 3-Edge Colorings of Cubic Graphs

On the Number of 3-Edge Colorings of Cubic Graphs

In this paper we present a short algebraic proof for a generalization of a formula of R. Penrose, Some applications of negative dimensional tensors, in: Combinatorial Mathematics and its Applications Welsh (ed.), Academic Press, 1971, pp. 221?244 on the number of 3-edge colorings of a plane cubic graph. We also show that the number of 3-edge colorings of cubic graphs can be computed (up to a factor of 2| E |/3?1) by evaluating the Penrose polynomial of their cycle space at 4.

Christian Szegedy | Christian Szegedy

[1] Frank Harary,et al. Graph Theory , 2016 .

[2] P. Rosenstiehl,et al. On the Principal Edge Tripartition of a Graph , 1978 .

[3] François Jaeger,et al. On Tutte polynomials and cycles of plane graphs , 1987, J. Comb. Theory, Ser. B.

[4] F. Jaeger. On Edge-Colorings of Cubic Graphs and a Formula of Roger Penrose , 1988 .

[5] François Jaeger,et al. On the penrose number of cubic diagrams , 1989, Discret. Math..

[6] François Jaeger,et al. On Tutte Polynomials of Matroids Representable Over GF(q) , 1989, Eur. J. Comb..

[7] F. Jaeger. On Transition Polynomials of 4-Regular Graphs , 1990 .

[8] Tom Brylawski,et al. Matroid Applications: The Tutte Polynomial and Its Applications , 1992 .

[9] M. Aigner. The Penrose polynomial of a plane graph , 1997 .

[10] Gordon F. Royle,et al. Algebraic Graph Theory , 2001, Graduate texts in mathematics.