Pages that link to "Item:Q2161229"
From MaRDI portal
The following pages link to Improved approximation for maximum edge colouring problem (Q2161229):
Displaying 5 items.
- Improved edge-coloring algorithms for planar graphs (Q3495664) (← links)
- Improved Inapproximability Results for Maximum k-Colorable Subgraph (Q3638876) (← links)
- Dynamic Edge Coloring with Improved Approximation (Q5236303) (← links)
- New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring (Q6197752) (← links)
- Approximating maximum edge 2-coloring by normalizing graphs (Q6574923) (← links)