The Penrose polynomial of a plane graph (Q1359525): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 15:30, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Penrose polynomial of a plane graph |
scientific article |
Statements
The Penrose polynomial of a plane graph (English)
0 references
6 July 1997
0 references
Some 25 years ago Penrose derived several remarkable expressions for the number of 3-edge colorings of a connected 3-regular plane graph \(G\), defining implicitly what is now called the Penrose polynomial \(P(G,\lambda)\). In this paper the Penrose polynomial is studied for arbitrary connected plane graphs. We give an equivalent definition of \(P(G,\lambda)\) in terms of cycles and cocycles and deduce some results on the coefficients and the evaluation of \(P(G,\lambda)\) at integral \(\lambda\). In particular, the Penrose formulae are generalized to arbitrary plane graphs. In addition, connections to the Tutte polynomial, transition systems and the 4-color theorem are discussed.
0 references
colorings
0 references
plane graph
0 references
Penrose polynomial
0 references
cycles
0 references
cocycles
0 references
Tutte polynomial
0 references
transition systems
0 references