zbMATH — the first resource for mathematics

The number of edge 3-colorings of a planar cubic graph as a permanent. (English) Zbl 0281.05103

05C15 Coloring of graphs and hypergraphs
05C10 Planar graphs; geometric and topological aspects of graph theory
05A19 Combinatorial identities, bijective combinatorics
15B36 Matrices of integers
Full Text: DOI
[1] S. Fisk, Combinatorial structure on triangulations I: the structure of four colorings, to appear. · Zbl 0277.55005
[2] Ore, O., Theory of graphs, (1962), Am. Math. Soc., Providence, R.I.,
[3] Ore, O., The four color problem, (1967), Academic Press New York · Zbl 0149.21101
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.