Search
Menu
Home
Sources
About
Contacts
Kittell graph
In the
mathematical field
of
graph theory
, the
Kittell
graph
is a
planar graph
with
23
vertices
and
63
edges
. Its
unique
planar embedding
has
42
triangular
faces
. The Kittell graph is named after
Irving
Kittell, who used it as a counterexample to
Alfred
Kempe's
flawed
proof
of the
four-color theorem
.
Simpler
counterexamples
include the
Errera graph
and
Poussin graph
and the
Fritsch graph
and
Soifer graph
.