Sequences, claws and cyclability of graphs
Lists
Only you see this
Abstract
A subset S of vertices of a graph G is called cyclable in G if there is in G some cycle containing all the vertices of S. We give two results on the cyclability of a vertex subset in graphs, one of which is related to “hamiltonian-nice-sequence” conditions and the other of which is related to “claw-free” conditions. They imply many known results on hamiltonian graph theory. Moreover, the analogous results related to the hamilton-connectivity or to the existence of dominating cycle are also given. © 1996 John Wiley & Sons, Inc.
BibTeX
@article{favaron1996sequences,
author = {Odile Favaron and Evelyne Flandrin and Hao Li and Yiping Liu and Feng Tian and Wu Zhengsheng},
title = {{Sequences, claws and cyclability of graphs}},
journal = {Journal of Graph Theory},
year = {1996},
doi = {10.1002/(sici)1097-0118(199604)21:4<357::aid-jgt1>3.0.co;2-o},
}Loading related content...