Hamiltonian Decomposition of Lexicographic Products of Digraphs

@article{Ng1998HamiltonianDO,
  title={Hamiltonian Decomposition of Lexicographic Products of Digraphs},
  author={Lenhard L. Ng},
  journal={J. Comb. Theory, Ser. B},
  year={1998},
  volume={73},
  pages={119-129}
}
The problem of decomposing a graph or digraph into hamiltonian cycles is of significant interest, as evidenced by the survey on hamiltonian decomposition by Alspach, Bermond, and Sotteau [1]. In [4], the author shows that all complete regular multipartite digraphs are decomposable into directed hamiltonian cycles, thus resolving a conjecture in [1]. In this paper, we address a related and somewhat more general conjecture of Alspach, Bermond, and Sotteau. 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
5 Extracted Citations
5 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-5 of 5 references

Decompositions into cycles I: Hamiltonian decompositions, in ``Cycles and Rays'

  • B. Alspach, J.-C. Bermond, D. Sotteau
  • (G. Hahn, Ed.),
  • 1990
Highly Influential
5 Excerpts

Sza sz, Hamiltonian decomposition of lexicographic product

  • G.R.Z. Baranyai
  • J. Combin. Theory Ser. B
  • 1981
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…