3 papers
cs.CG2021
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…
math.CO2019
Shellings and sheddings induced by collapses
Thomas Magnard, Michael Skotnica, Martin Tancer
We say that a pure simplicial complex of dimension satisfies the removal-collapsibility condition if is either empty or becomes collap…
cs.CG2018
Embedding graphs into two-dimensional simplicial complexes
Éric Colin de Verdière, Thomas Magnard, Bojan Mohar
We consider the problem of deciding whether an input graph G admits a topological embedding into a two-dimensional simplicial complex C. This problem includes, among others, the em…