Solved: (Scheduling and matching) Three teachers Xl, X2'
Chapter 23, Problem 23.1.145(choose chapter or problem)
(Scheduling and matching) Three teachers Xl, X2' -'3 teach four classes )'1, Y2, Y3, Y4 for these numbers of periods: Y1 Y2 y .3 " .4 Xl 0 1 1 X2 1 I 1 -'"3 0 1 1 Show that this arrangement can be represented by a bipartite graph G and that a teaching schedule for one period corresponds to a matching in G. Set up a teaching schedule with the smallest possible number of periods.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer