Quizzes for review
In our graph theory seminar, we used Ore's theorem to prove that the network contains a Hamiltonian cycle.
See correct answer
In our graph theory seminar, we used Ore's theorem to prove that the network contains a Hamiltonian cycle.
音声機能が動作しない場合はこちらをご確認ください
Related words
Ore's theorem
Proper noun
Japanese Meaning
グラフ理論において、隣接していない頂点の全ての組に対し、それらの頂点の次数（辺の数）の和がグラフ全体の頂点数以上であれば、そのグラフはハミルトン閉路（すべての頂点を一度ずつ通る閉路）を持つという定理
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
