Article thumbnail
Location of Repository

On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed

By Atsushi Kaneko and Kiyoshi Yoshimoto


AbstractLet G be a graph with n vertices and minimum degree at least n/2, and let d be a positive integer such that d⩽n/4. We define a distance between two vertices as the number of edges of a shortest path joining them. In this paper, we show that, for any vertex subset A with at most n/2d vertices, there exists a Hamiltonian cycle in which the distance between any two vertices of A is at least d

Publisher: Academic Press.
Year: 2001
DOI identifier: 10.1006/jctb.2000.1999
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.