
Any graph with 9 or fewer vertices that can be embedded on a torus and linklessly in 3D space can also be embedded linklessly within the standard unknotted torus.


coremsg

linklessly-embedding-toroidal-non-intrinsically-linked-graphs-of-order-9-and-below-in-the-standard-torus


Linklessly Embedding Toroidal, Non-Intrinsically-Linked Graphs of Order 9 and Below in the Standard Torus


title_rewrite


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.


construction-of-complete-graph-embeddings-with-duals-of-low-connectivity-and-near-optimal-genus


Construction of Complete Graph Embeddings with Duals of Low Connectivity and Near-Optimal Genus



Graph Embeddings zur Bewältigung von Sampling-Bias in ökologischen Netzwerken.


bipartiter-graph-variational-auto-encoder-zur-berücksichtigung-von-stichprobenverzerrungen-in-ökologischen-netzwerken


Bipartiter Graph Variational Auto-Encoder zur Berücksichtigung von Stichprobenverzerrungen in ökologischen Netzwerken
