. . "Herschel Graph"@en . . "In graph theory, a branch of mathematics, the Herschel graph is a bipartite undirected graph with 11 vertices and 18 edges. It is a polyhedral graph (the graph of a convex polyhedron), and is the smallest polyhedral graph that does not have a Hamiltonian cycle, a cycle passing through all its vertices. It is named after British astronomer Alexander Stewart Herschel, because of Herschel's studies of Hamiltonian cycles in polyhedral graphs (but not of this graph)."@en . "10343"^^ . . . "Graphe de Herschel"@fr . . . . . . . "Le graphe de Herschel est, en th\u00E9orie des graphes, un graphe poss\u00E9dant 11 sommets et 18 ar\u00EAtes."@fr . . . . . "Herschel graph"@en . . . . . "\u0413\u0440\u0430\u0444 \u0413\u0435\u0440\u0448\u0435\u043B\u044F"@uk . . . "\u0412 \u0442\u0435\u043E\u0440\u0438\u0438 \u0433\u0440\u0430\u0444\u043E\u0432 \u0433\u0440\u0430\u0444 \u0425\u0435\u0440\u0448\u0435\u043B\u044F \u2014 \u044D\u0442\u043E \u0434\u0432\u0443\u0434\u043E\u043B\u044C\u043D\u044B\u0439 \u043D\u0435\u043E\u0440\u0438\u0435\u043D\u0442\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u044B\u0439 \u0433\u0440\u0430\u0444 \u0441 11 \u0432\u0435\u0440\u0448\u0438\u043D\u0430\u043C\u0438 \u0438 18 \u0440\u0451\u0431\u0440\u0430\u043C\u0438, \u043D\u0430\u0438\u043C\u0435\u043D\u044C\u0448\u0438\u0439 \u043D\u0435\u0433\u0430\u043C\u0438\u043B\u044C\u0442\u043E\u043D\u043E\u0432 \u043F\u043E\u043B\u0438\u044D\u0434\u0440\u0430\u043B\u044C\u043D\u044B\u0439 \u0433\u0440\u0430\u0444. \u0413\u0440\u0430\u0444 \u043D\u0430\u0437\u0432\u0430\u043D \u043F\u043E \u0438\u043C\u0435\u043D\u0438 \u0431\u0440\u0438\u0442\u0430\u043D\u0441\u043A\u043E\u0433\u043E \u0430\u0441\u0442\u0440\u043E\u043D\u043E\u043C\u0430 , \u043D\u0430\u043F\u0438\u0441\u0430\u0432\u0448\u0435\u0433\u043E \u0440\u0430\u043D\u043D\u044E\u044E \u0440\u0430\u0431\u043E\u0442\u0443 \u043F\u043E \u043F\u043E\u0432\u043E\u0434\u0443 \u0438\u0433\u0440\u044B \u00AB\u0418\u043A\u043E\u0441\u0438\u0430\u043D\u00BB \u0423\u0438\u043B\u044C\u044F\u043C\u0430 \u0420\u043E\u0443\u044D\u043D\u0430 \u0413\u0430\u043C\u0438\u043B\u044C\u0442\u043E\u043D\u0430 \u2014 \u0433\u0440\u0430\u0444 \u0425\u0435\u0440\u0448\u0435\u043B\u044F \u0434\u0430\u0451\u0442 \u043D\u0430\u0438\u043C\u0435\u043D\u044C\u0448\u0438\u0439 \u0432\u044B\u043F\u0443\u043A\u043B\u044B\u0439 \u043C\u043D\u043E\u0433\u043E\u0433\u0440\u0430\u043D\u043D\u0438\u043A, \u0434\u043B\u044F \u043A\u043E\u0442\u043E\u0440\u043E\u0433\u043E \u0438\u0433\u0440\u0430 \u043D\u0435 \u0438\u043C\u0435\u0435\u0442 \u0440\u0435\u0448\u0435\u043D\u0438\u044F. \u041E\u0434\u043D\u0430\u043A\u043E \u0441\u0442\u0430\u0442\u044C\u044F \u0425\u0435\u0440\u0448\u0435\u043B\u044F \u043E\u043F\u0438\u0441\u044B\u0432\u0430\u0435\u0442 \u0440\u0435\u0448\u0435\u043D\u0438\u044F \u0434\u043B\u044F \u0438\u0433\u0440\u044B \u00AB\u0418\u043A\u043E\u0441\u0438\u0430\u043D\u00BB \u0442\u043E\u043B\u044C\u043A\u043E \u0434\u043B\u044F \u0442\u0435\u0442\u0440\u0430\u044D\u0434\u0440\u0430 \u0438 \u0438\u043A\u043E\u0441\u0430\u044D\u0434\u0440\u0430, \u0438 \u043D\u0435 \u043E\u043F\u0438\u0441\u044B\u0432\u0430\u0435\u0442 \u0433\u0440\u0430\u0444 \u0425\u0435\u0440\u0448\u0435\u043B\u044F."@ru . . . . "24670148"^^ . . . . "In graph theory, a branch of mathematics, the Herschel graph is a bipartite undirected graph with 11 vertices and 18 edges. It is a polyhedral graph (the graph of a convex polyhedron), and is the smallest polyhedral graph that does not have a Hamiltonian cycle, a cycle passing through all its vertices. It is named after British astronomer Alexander Stewart Herschel, because of Herschel's studies of Hamiltonian cycles in polyhedral graphs (but not of this graph)."@en . "\u0413\u0440\u0430\u0444 \u0425\u0435\u0440\u0448\u0435\u043B\u044F"@ru . . . . . . . . . . "11"^^ . . . . . "cs2"@en . "12"^^ . "2"^^ . . . "4"^^ . . . . . "4"^^ . . . . . "4"^^ . . . . . . . "\u0412 \u0442\u0435\u043E\u0440\u0438\u0438 \u0433\u0440\u0430\u0444\u043E\u0432 \u0433\u0440\u0430\u0444 \u0425\u0435\u0440\u0448\u0435\u043B\u044F \u2014 \u044D\u0442\u043E \u0434\u0432\u0443\u0434\u043E\u043B\u044C\u043D\u044B\u0439 \u043D\u0435\u043E\u0440\u0438\u0435\u043D\u0442\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u044B\u0439 \u0433\u0440\u0430\u0444 \u0441 11 \u0432\u0435\u0440\u0448\u0438\u043D\u0430\u043C\u0438 \u0438 18 \u0440\u0451\u0431\u0440\u0430\u043C\u0438, \u043D\u0430\u0438\u043C\u0435\u043D\u044C\u0448\u0438\u0439 \u043D\u0435\u0433\u0430\u043C\u0438\u043B\u044C\u0442\u043E\u043D\u043E\u0432 \u043F\u043E\u043B\u0438\u044D\u0434\u0440\u0430\u043B\u044C\u043D\u044B\u0439 \u0433\u0440\u0430\u0444. \u0413\u0440\u0430\u0444 \u043D\u0430\u0437\u0432\u0430\u043D \u043F\u043E \u0438\u043C\u0435\u043D\u0438 \u0431\u0440\u0438\u0442\u0430\u043D\u0441\u043A\u043E\u0433\u043E \u0430\u0441\u0442\u0440\u043E\u043D\u043E\u043C\u0430 , \u043D\u0430\u043F\u0438\u0441\u0430\u0432\u0448\u0435\u0433\u043E \u0440\u0430\u043D\u043D\u044E\u044E \u0440\u0430\u0431\u043E\u0442\u0443 \u043F\u043E \u043F\u043E\u0432\u043E\u0434\u0443 \u0438\u0433\u0440\u044B \u00AB\u0418\u043A\u043E\u0441\u0438\u0430\u043D\u00BB \u0423\u0438\u043B\u044C\u044F\u043C\u0430 \u0420\u043E\u0443\u044D\u043D\u0430 \u0413\u0430\u043C\u0438\u043B\u044C\u0442\u043E\u043D\u0430 \u2014 \u0433\u0440\u0430\u0444 \u0425\u0435\u0440\u0448\u0435\u043B\u044F \u0434\u0430\u0451\u0442 \u043D\u0430\u0438\u043C\u0435\u043D\u044C\u0448\u0438\u0439 \u0432\u044B\u043F\u0443\u043A\u043B\u044B\u0439 \u043C\u043D\u043E\u0433\u043E\u0433\u0440\u0430\u043D\u043D\u0438\u043A, \u0434\u043B\u044F \u043A\u043E\u0442\u043E\u0440\u043E\u0433\u043E \u0438\u0433\u0440\u0430 \u043D\u0435 \u0438\u043C\u0435\u0435\u0442 \u0440\u0435\u0448\u0435\u043D\u0438\u044F. \u041E\u0434\u043D\u0430\u043A\u043E \u0441\u0442\u0430\u0442\u044C\u044F \u0425\u0435\u0440\u0448\u0435\u043B\u044F \u043E\u043F\u0438\u0441\u044B\u0432\u0430\u0435\u0442 \u0440\u0435\u0448\u0435\u043D\u0438\u044F \u0434\u043B\u044F \u0438\u0433\u0440\u044B \u00AB\u0418\u043A\u043E\u0441\u0438\u0430\u043D\u00BB \u0442\u043E\u043B\u044C\u043A\u043E \u0434\u043B\u044F \u0442\u0435\u0442\u0440\u0430\u044D\u0434\u0440\u0430 \u0438 \u0438\u043A\u043E\u0441\u0430\u044D\u0434\u0440\u0430, \u0438 \u043D\u0435 \u043E\u043F\u0438\u0441\u044B\u0432\u0430\u0435\u0442 \u0433\u0440\u0430\u0444 \u0425\u0435\u0440\u0448\u0435\u043B\u044F."@ru . . . . . . "3"^^ . . "18"^^ . . . . . . . . . . . . . . . . . . . . . . . . . . . "The Herschel graph."@en . "Le graphe de Herschel est, en th\u00E9orie des graphes, un graphe poss\u00E9dant 11 sommets et 18 ar\u00EAtes."@fr . . "1110399917"^^ . "HerschelGraph"@en . . . . . . . . . . "Herschel graph"@en . . .