最終更新日
：2024/08/04
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).
復習用の問題
(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
The four color theorem was proven in 1976 by Kenneth Appel and Wolfgang Haken.
正解を見る
The four color theorem was proven in 1976 by Kenneth Appel and Wolfgang Haken.
English Dictionary
項目の編集設定
- 項目の編集権限を持つユーザー - すべてのユーザー
- 項目の新規作成を審査する
- 項目の編集を審査する
- 項目の削除を審査する
- 重複の恐れのある項目名の追加を審査する
- 項目名の変更を審査する
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
例文の編集設定
- 例文の編集権限を持つユーザー - すべてのユーザー
- 例文の削除を審査する
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
問題の編集設定
- 問題の編集権限を持つユーザー - すべてのユーザー
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
