Pages that link to "Item:Q2446103"

The following pages link to Hardness and inapproximability of convex recoloring problems (Q2446103):

Displayed 3 items.

• The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683) ‎ (← links)
• Strong intractability results for generalized convex recoloring problems (Q2184691) ‎ (← links)
• Strong intractability of generalized convex recoloring problems (Q2413156) ‎ (← links)