Facial parity edge colouring of plane pseudographs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics Année : 2012

Facial parity edge colouring of plane pseudographs

Résumé

A facial parity edge colouring of a connected bridgeless plane graph is such an edge colouring in which no two face-adjacent edges receive the same colour and, in addition, for each face f and each colour c, either no edge or an odd number of edges incident with f is coloured with c. Let χ′p(G) denote the minimum number of colours used in such a colouring of G. In this paper we prove that χ′p(G) ≤ 20 for any 2-edge-connected plane graph G. In the case when G is a 3-edge-connected plane graph the upper bound for this parameter is 12. For G being 4-edge-connected plane graph we have χ′p(G) ≤ 9. On the other hand we prove that some bridgeless plane graphs require at least 10 colours for such a colouring.
Fichier principal
Vignette du fichier
Facial_parity_edge_colouring_08.08.2011.pdf (140.61 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00988963 , version 1 (09-05-2014)

Identifiants

  • HAL Id : hal-00988963 , version 1

Citer

Július Czap, Stanislav Jendrol', František Kardoš, Roman Soták. Facial parity edge colouring of plane pseudographs. Discrete Mathematics, 2012, 312 (17), pp.2735-2740. ⟨hal-00988963⟩

Collections

TDS-MACS
47 Consultations
170 Téléchargements

Partager

Gmail Facebook X LinkedIn More