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