最終更新日：2024/08/04
(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).
正解を見る
four color theorem
編集履歴（0）
元となった辞書の項目
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).
意味（1）
(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).
