Pages that link to "Item:Q2498986"

The following pages link to Inapproximability and approximability of maximal tree routing and coloring (Q2498986):

Displaying 3 items.

• The complexity of minimum convex coloring (Q415283) (← links)
• Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
• Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)