Facial colorings using Hall's Theorem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Combinatorics Année : 2010

Facial colorings using Hall's Theorem

Résumé

A vertex coloring of a plane graph is ℓ-facial if every two distinct vertices joined by a facial walk of length at most ℓ receive distinct colors. It has been conjectured that every plane graph has an ℓ-facial coloring with at most 3ℓ+1 colors. We improve the currently best known bound and show that every plane graph has an ℓ-facial coloring with at most 7ℓ/2+6 colors. Our proof uses the standard discharging technique, however, in the reduction part we have successfully applied Hall's Theorem, which seems to be quite an unusual approach in this area.
Fichier principal
Vignette du fichier
HKSS10.pdf (239.8 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00487100 , version 1 (27-05-2010)

Identifiants

Citer

Frédéric Havet, Daniel Král', Jean-Sébastien Sereni, Riste Skrekovski. Facial colorings using Hall's Theorem. European Journal of Combinatorics, 2010, 31 (3), pp.1001--1019. ⟨10.1016/j.ejc.2009.10.003⟩. ⟨hal-00487100⟩
447 Consultations
120 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More