Moreover, \((D+1)\) -colored graphs representing manifolds are related, through the combinatorial/topological bubble routing algorithms to core graphs that are called crystallizations in the graph-encoded manifold literature [1]}. The combinatorial and topological bubble routing algorithms coincide for manifolds, since all \(D\) -bubbles are homeomorphic to spheres and the routing algorithms only involve dipole contractionCombinatorial 1-dipole insertion may produce two non-spherical \(D\) -bubbles from an initial spherical one..
