|
|||||
|
|
Hamiltonian decomposition of lexicographic product |
|
| Authors: | Z Baranyai GyR Szász |
| Institution: | Eötvös Loránd University, Budapest, Hungary |
| 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. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |