An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes

Éric Colin de Verdière, Thomas Magnard

We consider the embeddability problem of a graph G into a two-dimensional simplicial complex C: Given G and C, decide whether G admits a topological embedding into C. The problem i…