Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time
Résumé
For any c>1, we describe a linear time algorithm for fractionally edge colouring simple graphs with maximum degree at least |V|/c.
Communication Dans Un Congrès
Année : 2009
Alain Monteil : Connectez-vous pour contacter le contributeur
https://inria.hal.science/hal-00795286
Soumis le : mercredi 27 février 2013-17:03:21
Dernière modification le : lundi 26 février 2024-11:22:07
Citer
S. Kennedy, C. Meagher, Bruce Reed. Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time. European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), 2009, Bordeaux, France. pp.47―51, ⟨10.1016/j.endm.2009.07.008⟩. ⟨hal-00795286⟩
Collections
87
Consultations
0
Téléchargements