
Journal of Automata, Languages and Combinatorics
formerly:
Journal of Information Processing and Cybernetics /
Elektronische Informationsverarbeitung und Kybernetik


@article{jalc020203,
author = {Matthias Kriesell},
title = {A Note on Hamiltonian Cycles in Lexicographical Products},
journal = jalc,
year = 1997,
volume = 2,
number = 2,
pages = {135138},
keywords = {hamiltonian path, lexicographical product,
vertex transitive graph, toughness, multiple of a multigraph},
abstract = {A typical sufficient condition for the existence of a
hamiltonian cycle in a lexicographical product $G[H]$ of two
graphs $G$ and $H$ forces $G$ to contain a hamiltonian cycle
or $G$ to contain a hamiltonian path and $H$ to have some
additional properties. We present some sufficient conditions
in terms of toughness and factors which are much weaker in
many cases. A typical statement is that $G[H]$ is
hamiltonian if $G$ is $2$edge connected and cubic and
$H \geq 2$.}
}