Pages that link to "Item:Q293395"
From MaRDI portal
The following pages link to Improving a family of approximation algorithms to edge color multigraphs (Q293395):
Displaying 7 items.
- Approximating the chromatic index of multigraphs (Q630193) (← links)
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950) (← links)
- An upper bound for the chromatic number of line graphs (Q2461774) (← links)
- On hitting all maximum cliques with an independent set (Q3067059) (← links)
- Improving the performance guarantee for approximate graph coloring (Q3763600) (← links)
- Densities, Matchings, and Fractional Edge-Colorings (Q4620419) (← links)
- An asymptotic approximation scheme for multigraph edge coloring (Q4962714) (← links)
