On edge-colorings of bicubic planar graphs
Combinatorics
2013-12-03 v1
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.
Keywords
Cite
@article{arxiv.1312.0361,
title = {On edge-colorings of bicubic planar graphs},
author = {Louis-Hadrien Robert},
journal= {arXiv preprint arXiv:1312.0361},
year = {2013}
}
Comments
11 pages, 7 figures, comments welcome