The following pages link to Mixed graph colorings (Q1360876):
Displayed 15 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)
- Complexity of two coloring problems in cubic planar bipartite mixed graphs (Q968180) (← links)
- Using stable sets to bound the chromatic number (Q1014408) (← links)
- Mixed graph edge coloring (Q1043571) (← links)
- On a multiconstrained model for chromatic scheduling (Q1293198) (← links)
- Parameterized mixed graph coloring (Q2424815) (← links)
- On two coloring problems in mixed graphs (Q2426450) (← links)
- Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- (Q5863594) (← links)
- A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (Q6047981) (← links)
- Coloring mixed and directional interval graphs (Q6172218) (← links)