Name
Abstract | ||
|---|---|---|
Sharp minimum degree and degree sum conditions are proven for the existence of a Hamiltonian cycle passing through specified vertices with prescribed distances between them in large graphs. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s00373-017-1762-y | Graphs and Combinatorics |
Keywords | Field | DocType |
Hamiltonian cycle, Distance, Regularity Lemma | Topology,Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Hamiltonian path,Hamiltonian path problem,Mathematics | Journal |
Volume | Issue | ISSN |
33 | 2 | 1435-5914 |
Citations | PageRank | References |
1 | 0.40 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ronald J. Gould | 1 | 641 | 94.81 |
| Colton Magnant | 2 | 113 | 29.08 |
| Pouria Salehi Nowbandegani | 3 | 5 | 4.30 |