Related articles:
Graph theory
Graph (mathematics)
Graph coloring
Tree (graph theory)
Four color theorem
Euler characteristic
Key terms:
graph
planar
edges
faces
plane
theorem
dual
planar graph
vertices
finite
embedding
minus
intersect
graph theory
subgraph
connected
vertex
convex
algorithm
sphere
polyhedron
grafo
bader
bounded
subdivision
puzzle
forbidden
characterization
plane graph
if and only if
finite graph
polyhedra
planar if
outer face
dual graph
three edges
t intersect
linear time
graph is planar
every simple
homeomorphic
holds for all
plane without
planarity criterion
only if it does
including the outer
kuratowski subgraph
without edge intersections
embedding in the plane such
gives a characterization based
Search external links cited by footnotes on Wikipedia page Planar graph:
|
|