• Title of article

    Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time

  • Author/Authors

    Kennedy، نويسنده , , W. Sean and Meagher، نويسنده , , Conor and Reed، نويسنده , , Bruce A.، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2009
  • Pages
    5
  • From page
    47
  • To page
    51
  • Abstract
    For any c > 1 , we describe a linear time algorithm for fractionally edge colouring simple graphs with maximum degree at least | V | / c .
  • Keywords
    edge colouring , overfull subgraph , fractional chromatic index
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Serial Year
    2009
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Record number

    1455066

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=1455066