Graph Embeddings zur Bewältigung von Sampling-Bias in ökologischen Netzwerken.
This paper presents a construction method for embedding complete graphs on surfaces where the dual graph has low connectivity, specifically a cutvertex, and the genus of the embedding is close to the theoretical minimum.