Originally Posted by Jerrek

You can't... You're esentially turning this into a bipartite graph. Using elementary combinatorics, it can be proven that this graph can't be turned into a bipartite graph because the total number of edges in conjunction with the 5 vertices requires a tripartite graph to exist.

You can even apply the 2-color, or 3-color theorem to this graph.