Research any topic before you write.
Find related topics. | Discover entities. | See connections. | Build a topical map.
Graph embedding: Computational complexity, Embeddings of graphs into higher-dimensional spaces & Combinatorial embedding
In topological graph theory, an embedding (also spelled imbedding) of a graph G {\displaystyle G} on a surface Σ {\displaystyle \Sigma } is a representation of G {\displaystyle G} on Σ {\displaystyle \Sigma } in which points of Σ {\displaystyle \Sigma } are associated with vertices and simple arcs (homeomorphic images of {\displaystyle } ) are associated…
Language: English [EN]
