Facial colorings using Hall's Theorem - Archive ouverte HAL Access content directly
Journal Articles European Journal of Combinatorics Year : 2010

Facial colorings using Hall's Theorem

Abstract

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
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

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⟩
441 View
106 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More