Jump to content

Graph embedding

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Taxipom (talk | contribs) at 19:31, 27 November 2006 (Creation of the article (stub)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In Topological graph theory, an embedding of a graph on a surface (which stands here for a compact arc-connected Hausdorff space locally homeomorphic to a disk) is the equivalence class (for homeomorphism) of representations of on in which points are associated to vertices, simple arcs (homeomorphic images of ) are associated to edges in such a way that:

  • the endpoints of the arc associated to an edge are the points associated to the end vertices of ,
  • an arc include no points associated with other vertices,
  • two arcs never intersect at a point which is interior to one of the arc.

If a graph is embedded on a closed surface , the complement of the union of the points and arcs associated to the vertices and edges of is a familly of regions (or faces). A 2-cell embedding is an embedding in which every face is homeomorphic to an open disk.