On edge-colorings of bicubic planar graphs
classification
🧮 math.CO
keywords
bicubiccoloringsdegreeedge-coloringsgraphskempepartplanar
read the original abstract
In the first part, we introduce a notion a degree of edge-colorings of bicubic plane graphs and proves some local formula of the graded number of colorings. In the second part, we give a new proof of a result of Fisk saying that any two edge-3-colorings of a planar bicubic graph are Kempe equivalent. Additionaly we show that the degree of colorings behaves well with respect to Kempe equivalence.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.