15 citations · 22 across the 5 of their papers we have counts for
1 paper · 2 filters
É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…