Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546)

Let \(\mathcal {C}\) be a proper \(2\)-coloring of a triangulation \(\mathcal{T}\) of the sphere by white and black colors with the vertex set \(V\); i.e., no two triangles in \(\mathcal{T}\) of the same color share an edge.\ Further, let \(G_{W}\) (\(G_{B}\)) be an abelian group on \(V\) defined by the relation \(r+s+t=0\) if \(\{r,s,t\}\) is a white triangle in \(\mathcal C\) (a black triangle in \(\mathcal{C}\)). In this paper, the authors prove a conjecture of Cavenagh and Wanless that the two groups \(G_{W}\) and \(G_{B}\) are isomorphic.