1 citations · 1 across the 10 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2024
Invariants of almost embeddings of graphs in the plane: results and problems
E. Alkin, E. Bordacheva, A. Miroshnikov +2
A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of alm…
math.CO2022★ 1 cited
A quadratic estimation for the Kühnel conjecture on embeddings
S. Dzhenzher, A. Skopenkov
The classical Heawood inequality states that if the complete graph on vertices is embeddable in the sphere with handles, then . A higher-…