On edge-colorings of bicubic planar graphs - Université Clermont Auvergne
Pré-Publication, Document De Travail Année : 2013

On edge-colorings of bicubic planar graphs

Résumé

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.

Dates et versions

hal-04154112 , version 1 (06-07-2023)

Identifiants

Citer

Louis-Hadrien Robert. On edge-colorings of bicubic planar graphs. 2023. ⟨hal-04154112⟩
17 Consultations
0 Téléchargements

Altmetric

Partager

More