Large sets of Hamilton cycle decompositions of complete bipartite graphs

8Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Let K2 t + 1, 2 t + 1 - I denote the complete bipartite graph K2 t + 1, 2 t + 1 minus a 1-factor. In this paper, we prove that there exist a large set of Hamilton cycle decomposition of K2 t, 2 t and a large set of Hamilton cycle decomposition of K2 t + 1, 2 t + 1 - I. © 2007 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Kang, Q., & Zhao, H. (2008). Large sets of Hamilton cycle decompositions of complete bipartite graphs. European Journal of Combinatorics, 29(6), 1492–1501. https://doi.org/10.1016/j.ejc.2007.06.011

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free