| Autor: |
Axler, S., Ribet, K. A., Bondy, J. A., Murty, U. S. R. |
| Zdroj: |
Graph Theory; 2008, p471-502, 32p |
| Abstrakt: |
Recall that a path or cycle which contains every vertex of a graph is called a Hamilton path or Hamilton cycle of the graph. Such paths and cycles are named after Sir William Rowan Hamilton, who described, in a letter to his friend Graves in 1856, a mathematical game on the dodecahedron (Figure 18.1a) in which one person sticks pins in any five consecutive vertices and the other is required to complete the path so formed to a spanning cycle (see Biggs et al. (1986) or Hamilton (1931)). Hamilton was prompted to consider such cycles in his early investigations into group theory, the three edges incident to a vertex corresponding to three generators of a group. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
