Pages that link to "Item:Q3196318"
From MaRDI portal
The following pages link to The Min-Max Edge q-Coloring Problem (Q3196318):
Displaying 10 items.
- Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721) (← links)
- Approximation algorithm for maximum edge coloring (Q1007243) (← links)
- Heuristic algorithms for the min-max edge 2-coloring problem (Q1791033) (← links)
- Minimax relations for the partial q-colorings of a graph (Q1825878) (← links)
- On \(\mathrm{M}_f\)-edge colorings of graphs (Q2158189) (← links)
- Maximizing the number of <i>q</i> -colorings (Q3059717) (← links)
- Approximation and Hardness Results for the Maximum Edge q-coloring Problem (Q3060768) (← links)
- The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks (Q3503543) (← links)
- Edge $k$-$q$-Colorability of Graphs (Q4637664) (← links)
- Approximating maximum edge 2-coloring by normalizing graphs (Q6574923) (← links)