Pages that link to "Item:Q3150263"
From MaRDI portal
The following pages link to Scheduling Problems and Mixed Graph Colorings (Q3150263):
Displayed 9 items.
- On weak chromatic polynomials of mixed graphs (Q489344) (← links)
- Coloring some classes of mixed graphs (Q858294) (← links)
- Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
- A note on mixed tree coloring (Q963351) (← links)
- Mixed graph edge coloring (Q1043571) (← links)
- On two coloring problems in mixed graphs (Q2426450) (← links)
- Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
- Routing equal-size messages on a slotted ring (Q2434298) (← links)
- On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)