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.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics