Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time

DOI10.1016/j.endm.2009.07.008zbMath1272.05050OpenAlexW2011846696MaRDI QIDQ2851436

Conor Meagher, W. Sean Kennedy, Bruce A. Reed

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.008

zbMATH Keywords

edge colouringfractional chromatic indexoverfull subgraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to find overfull subgraphs in graphs with large maximum degree
• How to find overfull subgraphs in graphs with large maximum degree. II
• The NP-Completeness of Edge-Coloring
• Odd Minimum Cut-Sets and b-Matchings
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time