Last Updated：2025/12/01
Sentence
Quizzes for review
The Herschel graph serves as a classic counterexample in graph theory, being the smallest non-Hamiltonian polyhedral graph: a bipartite undirected graph with eleven vertices and eighteen edges.
See correct answer
The Herschel graph serves as a classic counterexample in graph theory, being the smallest non-Hamiltonian polyhedral graph: a bipartite undirected graph with eleven vertices and eighteen edges.
音声機能が動作しない場合はこちらをご確認ください
Related words
Herschel graph
Proper noun
Japanese Meaning
数学・グラフ理論において、11頂点18辺を持つ二部対立無向グラフであり、最小のハミルトン閉路を持たない多面体グラフ。
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
