Set-orderedness as a generalization of k-orderedness and cyclability

@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}
}
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