Name
Abstract | ||
|---|---|---|
Let 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 /2 d vertices, there exists a Hamiltonian cycle in which the distance between any two vertices of A is at least d . |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1006/jctb.2000.1999 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
hamiltonian cycle,shortest path | Graph center,Wheel graph,Discrete mathematics,Combinatorics,Vertex (geometry),Cycle graph,Neighbourhood (graph theory),Distance,Balinski's theorem,Mathematics,Path graph | Journal |
Volume | Issue | ISSN |
81 | 1 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
11 | 1.11 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Atsushi Kaneko | 1 | 169 | 24.21 |
| Kiyoshi Yoshimoto | 2 | 133 | 22.65 |