Edge-Face Coloring of Plane Graphs with Maximum Degree Nine
Résumé
An edge-face coloring of a plane graph with edge set E and face set F is a coloring of the elements of E ∪ F so that adjacent or incident elements receive different colors. Borodin [Discrete Math 128(1-3):21-33, 1994] proved that every plane graph of maximum degree ∆≥10 can be edge-face colored with ∆+1 colors. We extend Borodin's result to the case where ∆=9.
Domaines
Mathématique discrète [cs.DM]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...