Abstract : For any c>1, we describe a linear time algorithm for fractionally edge colouring simple graphs with maximum degree at least |V|/c.
Type de document :
Communication dans un congrès
European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), 2009, Bordeaux, France. 34, pp.47―51, 2009, Electronic Notes on Discrete Mathematics. 〈10.1016/j.endm.2009.07.008〉
https://hal.inria.fr/hal-00795286
Contributeur : Alain Monteil
<>
Soumis le : mercredi 27 février 2013 - 17:03:21
Dernière modification le : lundi 5 novembre 2018 - 15:36:03
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. 34, pp.47―51, 2009, Electronic Notes on Discrete Mathematics. 〈10.1016/j.endm.2009.07.008〉. 〈hal-00795286〉
