![Důležité termíny](https://cdn.muni.cz/media/3633704/image_2.jpg?mode=crop¢er=0.5,0.5&rnd=133572412150000000&heightratio=0.5&width=278)
Informace o publikaci
Hamilton cycles in strong products of graphs
Autoři | |
---|---|
Rok publikování | 2005 |
Druh | Článek v odborném periodiku |
Časopis / Zdroj | Journal of Graph Theory |
Citace | |
Doi | http://dx.doi.org/10.1002/jgt.20058 |
Klíčová slova | Hamilton cycles; strong graph product; graph powers |
Popis | We prove that the strong product of any n connected graphs of maximum degree at most n contains a Hamilton cycle. In particular, G(Delta) ((G)) is hamiltonian for each connected graph G, which answers in affirmative a conjecture of Bermond, Germa, and Heydemann. (c) 2005 Wiley Periodicals, Inc. |