検索結果- 英語 - 英語
検索内容:
four color theorem
name
(graph
theory)
A
theorem
stating
that
given
any
separation
of
a
plane
into
contiguous
regions,
producing
a
figure
called
a
map,
no
more
than
four
colors
are
required
to
color
the
regions
so
that
no
two
adjacent
regions
have
the
same
color
(adjacent
being
defined
as
two
regions
sharing
a
boundary,
not
counting
corners,
in
which
three
or
more
regions
share
a
boundary).
clay-colored thrush
wear rose-colored glasses
wore rose colored glasses
wore rose-colored glasses
wears rose-colored glasses
loading!
Loading...