最終更新日：2025/12/01
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.
正解を見る
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.
音声機能が動作しない場合はこちらをご確認ください
編集履歴（0）
