![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
Hamiltonian threshold for strong products of graphs
Autoři | |
---|---|
Rok publikování | 2008 |
Druh | Článek v odborném periodiku |
Časopis / Zdroj | Journal of Graph Theory |
Citace | |
Doi | http://dx.doi.org/10.1002/jgt.20314 |
Klíčová slova | Hamilton cycle; strong graph product |
Popis | We prove that the strong product of any at least (In 2)Delta + O(root Delta) non-trivial connected graphs of maximum degree at most Delta is pancyclic. The obtained result is asymptotically best possible since the strong product of [(In 2)D] stars K-1,K-D is not even hamiltonian. (C) 2008 Wiley Periodicals, Inc. |