Edge Coloring and Decompositions of Weighted Graphs

DOI10.1007/978-3-540-87744-8_34zbMath1158.05318OpenAlexW2098488162MaRDI QIDQ3541103

Mohit Singh

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_34

Mathematics Subject Classification ID

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

Related Items (3)

Generalized Hypergraph Matching via Iterated Packing and Local Ratio ⋮ Equitable factorizations of edge-connected graphs ⋮ A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• [a,b-factors of graphs]
• ``Integer-making theorems
• On Nonblocking Multirate Interconnection Networks
• Improved Bounds on Nonblocking 3-Stage Clos Networks
• Nonblocking Multirate Networks
• On Multirate Rearrangeable Clos Networks
• On Rearrangeability of Multirate Clos Networks
• Some remarks about factors of graphs

This page was built for publication: Edge Coloring and Decompositions of Weighted Graphs