A linear bound for the Colin de Verdi\`ere parameter $\mu$ for graphs embedded on surfaces
Combinatorics
2023-03-20 v2 Computational Geometry
Abstract
We provide a combinatorial and self-contained proof that for all graphs embedded on a surface , the Colin de Verdi\`ere parameter is upper bounded by .
Cite
@article{arxiv.2303.00556,
title = {A linear bound for the Colin de Verdi\`ere parameter $\mu$ for graphs embedded on surfaces},
author = {Camille Lanuel and Francis Lazarus and Rudi Pendavingh},
journal= {arXiv preprint arXiv:2303.00556},
year = {2023}
}