Elsevier, Discrete Mathematics, 2(80), p. 167-173, 1990
DOI: 10.1016/0012-365x(90)90117-z
Full text: Download
We investigate hamiltonian properties of a class of graphs whose “factor graphs” are trees. Some results for regular and vertex-transitive graphs are also proved.