Every plane graph of maximum degree 8 has an edge-face 9-colouring - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Discrete Mathematics Année : 2011

Every plane graph of maximum degree 8 has an edge-face 9-colouring

Résumé

An edge-face colouring of a plane graph with edge set E and face set F is a colouring of the elements of E ∪ F such that adjacent or incident elements receive different colours. Borodin proved that every plane graph of maximum degree ∆ ≤ 10 can be edge-face coloured with ∆ + 1 colours. Borodin's bound was recently extended to the case where ∆=9. In this paper we extend it to the case ∆=8.
Fichier principal
Vignette du fichier
kss11.pdf (348.73 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00604185 , version 1 (28-06-2011)

Identifiants

Citer

Ross Kang, Jean-Sébastien Sereni, Matej Stehlík. Every plane graph of maximum degree 8 has an edge-face 9-colouring. SIAM Journal on Discrete Mathematics, 2011, 25 (2), pp.514--533. ⟨10.1137/090781206⟩. ⟨hal-00604185⟩
165 Consultations
107 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More