On the number of 3-edge colorings of cubic graphs (Q1348773)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1740673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of 3-edge colorings of cubic graphs |
scientific article; zbMATH DE number 1740673 |
Statements
On the number of 3-edge colorings of cubic graphs (English)
0 references
23 September 2002
0 references
The Penrose polynomial of a plane cubic graph was introduced by \textit{R. Penrose} [Comb. Math. Appl., Proc. Conf. Math. Inst., Oxford 1969, 221-224 (1971; Zbl 0216.43502)]. In this paper the Penrose polynomial is introduced for binary matroids and it is expressed as a sum of characteristics polynomials of some associated binary matroids. It is presented a short algebraic proof for a generalization of a formula of Penrose on the number of 3-edge colorings of a plane cubic graph and it is shown 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.
0 references
Penrose polynomial
0 references
plane cubic graph
0 references
3-edge coloring
0 references
binary matroid
0 references
matroids
0 references
0.8734397888183594
0 references
0.8582693934440613
0 references
0.8273859024047852
0 references
