On the number of 3-edge colorings of cubic graphs (Q1348773): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1978463456 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Penrose polynomial of a plane graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new 5‐arc‐transitive cubic graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4012032 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Tutte polynomials and cycles of plane graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Penrose number of cubic diagrams / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3822184 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Tutte polynomials of matroids representable over \(GF(q)\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Principal Edge Tripartition of a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4111952 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3140234 / rank | |||
Normal rank |
Latest revision as of 09:36, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the number of 3-edge colorings of cubic graphs |
scientific article |
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