arXiv · 2105.06905
Canonical decompositions and algorithmic recognition of spatial graphs
Abstract
We prove that there exists an algorithm for determining whether two piecewise-linear spatial graphs are isomorphic. In its most general form, our theorem applies to spatial graphs furnished with vertex colorings, edge colorings and/or edge orientations. We first show that spatial graphs admit canonical decompositions into blocks, that is, spatial graphs that are non-separable and have no cut vertices, in a suitable topological sense. Then we apply a result of Haken and Matveev in order to algorithmically distinguish these blocks.
Explore related subjects
Keep this discovery
Stefan Friedl, Lars Munser, José Pedro Quintanilha, Yuri Santos Rego. 2021-05-14. Canonical decompositions and algorithmic recognition of spatial graphs. https://doi.org/10.1017/s0013091524000087
Cite the original work for its findings. Save a collection to share your selection of sources.