Face counting in 3-edge-colored graphs [Source Code]

This C++ program enumerates certain 3-regular 3-edge-colored graphs G on 2n vertices. Let the colors of the graph edges be called 1, 2, and 3. A face is a bicolored cycle whose...