Abstract
In 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, too.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
