@inproceedings{66e98a791165479e948dc4856c69f692,

title = "Embedding cycles into hypercubes with prescribe vertices in the specific order",

abstract = "In this paper, we are interesting in a new cycle embedding problem. Let x1, x2,....xk be any k-vertices. Can we find a cycle C in the hypercube Qn such that C traverses these k vertices in the specific order? In this paper, we study k = 4. Let l be any even integer satisfying h(x1, x2) + h(x2, x3) + h(x3, x4) + h(x4, x1) ≤ l ≤ 2n. For n ≥ 5, we will prove that there exists a cycle C in Q n of length l such that C traverses these 4 vertices in the specific order except for the case that l ∈ {6,8} when 〈x1, x 3, x2, x4, x1〉 forms a cycle of length 4.",

keywords = "Hamiltonian, bipanconnected, bipancyclic, hypercube, ordered bipancyclic",

author = "Hsu, {Lih Hsing} and Lin, {Cheng Kuan} and Tan, {Jimmy J.M.} and Hung, {Chun Nan}",

year = "2011",

doi = "10.1109/CSE.2011.68",

language = "English",

isbn = "9780769544779",

series = "Proc. - 14th IEEE Int. Conf. on Computational Science and Engineering, CSE 2011 and 11th Int. Symp. on Pervasive Systems, Algorithms, and Networks, I-SPA 2011 and 10th IEEE Int. Conf. on IUCC 2011",

pages = "351--357",

booktitle = "Proc. - 14th IEEE Int. Conf. on Computational Science and Engineering, CSE 2011 and 11th Int. Symp.on Pervasive Systems, Algorithms, and Networks, I-SPAN 2011 and 10th IEEE Int. Conf. IUCC 2011",

note = "14th IEEE Int. Conf. on Computational Science and Engineering, CSE 2011, the 11th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2011, and the 10th IEEE Int. Conf. on Ubiquitous Computing and Communications, IUCC 2011 ; Conference date: 24-08-2011 Through 26-08-2011",

}