Facial parity edge colouring - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Ars Mathematica Contemporanea Année : 2011

Facial parity edge colouring

Résumé

A facial parity edge colouring of a connected bridgeless plane graph is an edge colouring in which no two face-adjacent edges (consecutive edges of a facial walk of some face) receive the same colour, in addition, for each face α and each colour c, either no edge or an odd number of edges incident with α is coloured with c. From Vizing's theorem it follows that every 3-connected plane graph has a such colouring with at most Δ* + 1 colours, where Δ* is the size of the largest face. In this paper we prove that any connected bridgeless plane graph has a facial parity edge colouring with at most 92 colours.
Fichier principal
Vignette du fichier
CJK11.pdf (118.47 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00634947 , version 1 (09-11-2011)

Identifiants

  • HAL Id : inria-00634947 , version 1

Citer

Július Czap, Stanislav Jendrol', František Kardoš. Facial parity edge colouring. Ars Mathematica Contemporanea, 2011, 4 (2), pp.255-269. ⟨inria-00634947⟩
125 Consultations
263 Téléchargements

Partager

Gmail Facebook X LinkedIn More