Map (graph theory)
Jump to navigation
Jump to search
This article relies largely or entirely on a single source. (April 2024) |

In topology and graph theory, a map is a subdivision of a surface such as the Euclidean plane into interior-disjoint regions, formed by embedding a graph onto the surface and forming connected components (faces) of the complement of the graph. That is, it is a tessellation of the surface. A map graph is a graph derived from a map by creating a vertex for each face and an edge for each pair of faces that meet at a vertex or edge of the embedded graph.[1]
References
[edit | edit source]- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).