Pages that link to "Item:Q3189026"

The following pages link to Partial convex recolorings of trees and galled networks (Q3189026):

Displaying 9 items.

• The convex recoloring problem: polyhedra, facets and computational experiments (Q263202) (← links)
• The complexity of minimum convex coloring (Q415283) (← links)
• The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683) (← links)
• An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
• A GRASP for the convex recoloring problem in graphs (Q2132370) (← links)
• Strong intractability results for generalized convex recoloring problems (Q2184691) (← links)
• Hardness and inapproximability of convex recoloring problems (Q2446103) (← links)
• Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems (Q3502673) (← links)
• A heuristic for the convex recoloring problem in graphs (Q6071077) (← links)