Pages that link to "Item:Q5226172"
From MaRDI portal
The following pages link to Complexity of edge coloring with minimum reload/changeover costs (Q5226172):
Displaying 8 items.
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683) (← links)
- Complexity of vertex switching on edge-bicolored graphs (Q2294065) (← links)
- On the complexity of constructing minimum changeover cost arborescences (Q2453161) (← links)
- Between Colorings and Layouts - Minimum Morphism Cost Problems (Q3439587) (← links)
- (Q5111862) (← links)
- Minimum reload cost graph factors (Q5918369) (← links)
- Constructing minimum changeover cost arborescenses in bounded treewidth graphs (Q5964020) (← links)
- Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398) (← links)