A CODE FOR DISCONNECTED EDGE-COLORED GRAPHS
We extend the definition of code of an edge-colored graph, given in [11] and [9], to the disconnected case and prove that our code keeps the same property of detecting color-isomorphic graphs.
edge-colored graphs, colored triangulations, color-isomorphism.