journal article
Hamiltonian decomposition of lexicographic product
Abstract
AbstractIn this paper we prove the conjecture of J.-C. Bermond (Ann. Discrete Math. 36 (1978), 21–28): If two graphs are decomposable into Hamiltonian cycles, then their lexicographic product is decomposable, tooSimilar works
Full text
Last time updated on 05/05/2017
This paper was published in Elsevier - Publisher Connector .
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.