|
Navigation:
Home:
Achievements:
Algorithms:
Downloads:
Theorems:
References:
Contact: |
|
| |
Glossary
graph:
A graph is a pair G=(V,E) where V is the set of vertices and E ⊆ {uv : u,v ∈ V ∧ u ≠ v}.
subgraph:
A graph H=(V',E') is a subgraph of a graph G, if V' ⊆ V, E' ⊆ E and every edge in E' has endpoints in V'.
planar:
A planar graph is a graph that can be drawn in the plane so that no two edges cross.
face:
When a planar graph is drawn so no edges cross, the edges divide the graph into regions called faces.
outerplanar:
An outerplanar graph is a planar graph that
can be drawn so that no edges cross and all vertices lie on the boundary of the outer face.
homeomorphic:
The graphs H1 and H2 are homeomorphic if they can both be obtained from a graph G by a series of subdivisions. A subdivision of an edge uv of G adds a new vertex w to V and replaces the edge uv with two edges uw and vw.
|
|