### Abstract

Let G be a graph with n vertices and minimum degree at least n/2, and B a set of vertices with at least 3n/4 vertices. In this paper, we show that there exists a hamiltonian cycle in which every vertex in B is adjacent to some vertex in B.

Original language | English |
---|---|

Pages (from-to) | X85-91 |

Journal | Discrete Mathematics |

Volume | 258 |

Issue number | 1-3 |

DOIs | |

Publication status | Published - 2002 Dec 6 |

### Keywords

- A minimum degree
- Dirac-type condition
- Hamiltonian cycles
- Specifed vertices

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'On a hamiltonian cycle in which specified vertices are not isolated'. Together they form a unique fingerprint.

## Cite this

Kaneko, A., Kawarabayashi, K. I., Ota, K., & Yoshimoto, K. (2002). On a hamiltonian cycle in which specified vertices are not isolated.

*Discrete Mathematics*,*258*(1-3), X85-91. https://doi.org/10.1016/S0012-365X(02)00263-7