@11 : if one doesn't kno the graph they are playing on... all a dishonest gov needs to do is select a single out-going edge from each vertex of V0 that the resulting subgraph has the property that in each cycle the largest occurring color is even.