The following pages link to Chromatic scheduling (Q2822599):
Displaying 13 items.
- The tournament scheduling problem with absences (Q323410) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- On the application of graph colouring techniques in round-robin sports scheduling (Q709125) (← links)
- A graph colouring model for assigning a heterogeneous workforce to a given schedule (Q1266545) (← links)
- On a multiconstrained model for chromatic scheduling (Q1293198) (← links)
- Chromatic scheduling and frequency assignment (Q1327228) (← links)
- Restricted coloring models for timetabling (Q1356739) (← links)
- Preassignment requirements in chromatic scheduling (Q1363744) (← links)
- Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants (Q2380445) (← links)
- Plurigraph coloring and scheduling problems (Q2628259) (← links)
- Split Vertices in Vertex Colouring and Their Application in Developing a Solution to the Faculty Timetable Problem (Q3772241) (← links)
- Compact Cylindrical Chromatic Scheduling (Q3985537) (← links)
- Scheduling N Burgers for a k-Burger Grill: Chromatic Numbers With Restrictions (Q5225513) (← links)
