Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time

S. Kennedy
  • Function : Author
C. Meagher
  • Function : Author

Abstract

For any c>1, we describe a linear time algorithm for fractionally edge colouring simple graphs with maximum degree at least |V|/c.

Dates and versions

hal-00795286 , version 1 (27-02-2013)

Identifiers

Cite

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⟩
85 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More