Pages that link to "Item:Q3651536"
From MaRDI portal
The following pages link to Approximating the Max Edge-Coloring Problem (Q3651536):
Displaying 8 items.
- Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721) (← links)
- Approximating the max-edge-coloring problem (Q986540) (← links)
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function (Q1888168) (← links)
- Approximation and Hardness Results for the Maximum Edge q-coloring Problem (Q3060768) (← links)
- On the Maximum Edge Coloring Problem (Q3602848) (← links)
- Optimal edge coloring of large graphs (Q4262695) (← links)
- An asymptotic approximation scheme for multigraph edge coloring (Q4962714) (← links)
- (Q5501309) (← links)