hamiltonian circuit
31Гамильтонов граф — Граф додекаэдра с выделенным циклом Гамильтона …
32Gabriel Andrew Dirac — (1925–1984) was a mathematician who mainly worked in graph theory. He stated a sufficient condition for a graph to contain a Hamiltonian circuit.Dirac received his Ph.D. in 1952 from the University of London. [MathGenealogy|id=42235] Dirac was… …
33Icosian game — Invented in 1857 by William Rowan Hamilton, the icosian game is the problem of finding a Hamiltonian circuit along the edges of an dodecahedron such that every vertex is visited a single time, no edge is visited twice, and the ending point is the …
34DHC — steht für: DHC Hannover Deutscher Hockey Club von 1910 aus Hannover de Havilland Canada, einen ehemaligen kanadischen Flugzeughersteller, DHC Delft, einen niederländischen Fußballverein, Dictionnaire historique et critique, eine Kombination aus… …
35HC — ist eine Abkürzung für: Aviaction, ehemalige deutsche Fluggesellschaft (IATA Code) Kreis Hainichen, Autokennzeichen des ehemaligen Kreises Hamiltonian Circuit, dt. Hamiltonkreis Handball Club Hardcore, diverse Bedeutungen Hardcover, bei Büchern:… …
36Hc — ist eine Abkürzung für Hockey Club Honoris Causa (lat.) = ehrenhalber, siehe auch Ehrendoktor das Autokennzeichen des ehemaligen Kreises Hainichen Handball Club Hospitality Club High Council (wörtlich Hoher Rat) Kohlenwasserstoffe HC Emissionen… …
37Цикл Гамильтона — Граф додекаэдра с выделенным циклом Гамильтона Гамильтонов граф в теории графов это граф, содержащий гамильтонову цепь или гамильтонов цикл. Гамильтонов путь (или гамильтонова цепь) путь (цепь), содержащий каждую вершину графа ровно один раз.… …
38Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …
39Eulerian path — In graph theory, an Eulerian path is a path in a graph which visits each edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the …
40Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …
