Recognizing Weak Embeddings

Akitaya, Hugo.

2018

Description
  • Abstract: An \emph{embedding} of a graph $G$ is a drawing $\varphi:G\rightarrow M$ of $G$ on a surface $M$ such that every vertex in $V(G)$ is mapped to a distinct point and edges in $E(G)$ to interior-disjoint Jordan arcs between the corresponding vertices. A \emph{weak embedding} is a map $\varphi:G\rightarrow M$ such that, for every $\varepsilon>0$, there exists an embedding $\psi_\varepsilo... read more
This object is in collection Corporate name Permanent URL
ID:
td96kd897
To Cite:
DCA Citation Guide    EndNote