Graph topological transformations in space-filling cell aggregates
Fig 5
3D graph transformations reduce to a T1 transition when applied to a 2D vertex model.
A ET transformation when applied to a four-polygon neighborhood described by a 2D vertex model. Parts of graphs shown in transparent are not matched because the corresponding elements do not exist in 2D. After relabeling the nodes (panel B) and repositioning them (panel C), we observe that the matched graph transformation exactly corresponds to , i.e., the graph transformation that performs a T1 transition (Fig 3).