A graph G is used as a model for a resource sharing system, where each vertex represents a process and an edge joining two vertices means that the corresponding processes share a resource. A scheduling of G is a mapping f : {1, 2, 3,...} -> 2(V(G)), where
