Colored graphs support a class of moves, termed \(k\) -dipole moves [1]}, [2]}, [3]}, that have a well controlled effect on their bubble structure. A priori, these are combinatorial in nature and allow one to set up the notion of combinatorial equivalence.
However, a subset are homeomorphisms of the graph complex, thus setting the stage for topological equivalence.
