Skip to Main content Skip to Navigation
Conference papers

Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time

S. Kennedy C. Meagher Bruce Reed 1 
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : For any c>1, we describe a linear time algorithm for fractionally edge colouring simple graphs with maximum degree at least |V|/c.
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/hal-00795286
Contributor : Alain Monteil Connect in order to contact the contributor
Submitted on : Wednesday, February 27, 2013 - 5:03:21 PM
Last modification on : Saturday, June 25, 2022 - 11:09:49 PM

Identifiers

Collections

CNRS | INRIA | I3S | INRIA2 | UNIV-COTEDAZUR

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

81

 

Contact                    Legal Notice                    Personal Data