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