Name
Abstract | ||
|---|---|---|
Let C be a cycle. The square of C is the graph obtained by joining every pair of vertices of distance 2 in C. Let G be a graph on n vertices with minimum degree $\delta(G)$. This paper proves that, if $\delta(G)\geq \frac{5}{7}n$ , then G contains the square of a Hamiltonian cycle. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1137/S0895480192232254 | SIAM J. Discrete Math. |
Keywords | Field | DocType |
n vertex,hamiltonian cycle,minimum degree | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Hamiltonian path,Mathematics | Journal |
Volume | Issue | ISSN |
7 | 2 | 0895-4801 |
Citations | PageRank | References |
12 | 2.38 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Genghua Fan | 1 | 412 | 65.22 |
| Roland Haggkvist | 2 | 12 | 2.38 |