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.
Domaines
Mathématique discrète [cs.DM]
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...