Pages that link to "Item:Q350721"

The following pages link to Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721):

Displaying 4 items.

• On \(\mathrm{M}_f\)-edge colorings of graphs (Q2158189) (← links)
• Improved approximation for maximum edge colouring problem (Q2161229) (← links)
• Complexity of Computing the Anti-Ramsey Numbers for Paths. (Q5089164) (← links)
• New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring (Q6197752) (← links)