## Disjoint cycles in hypercubes with prescribed vertices in each cycle

- Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu, Tzu-Liang Kung
- Discrete Applied Mathematics
- 2013

@article{Ishii2010SetorderednessAA, title={Set-orderedness as a generalization of k-orderedness and cyclability}, author={Keishi Ishii and Kenta Ozeki and Kiyoshi Yoshimoto}, journal={Discrete Mathematics}, year={2010}, volume={310}, pages={2310-2316} }

- Published 2010 in Discrete Mathematics
DOI:10.1016/j.disc.2010.05.005

A graph G is called k-ordered if for any sequence of k distinct vertices of G, there exists a cycle in G through these vertices in the order. A vertex set S is called cyclable in G if there exists a cycle passing through all vertices of S. We will define “set-orderedness” which is a natural generalization of k-orderedness and cyclability. We also give a… CONTINUE READING

### Presentations referencing similar topics