Last Updated：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.
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.
音声機能が動作しない場合はこちらをご確認ください
Edit Histories（0）
