Name
Abstract | ||
|---|---|---|
Let G be a simple \(m\times m\) bipartite graph with minimum degree \(\delta (G)\ge m/2+1\). We prove that for every pair of vertices x, y, there is a Hamiltonian cycle in G such that the distance between x and y along that cycle equals k, where \(2\le k<m/6\) is an integer having appropriate parity. We conjecture that this is also true up to \(k\le m\). |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s00373-015-1626-2 | Graphs and Combinatorics |
Keywords | Field | DocType |
Hamiltonian cycle, Bipartite graph, Panconnected bigraph, Enomoto’s conjecture, 05C45 | Discrete mathematics,Topology,Combinatorics,Bigraph,Vertex (geometry),Graph power,Hamiltonian path,Bipartite graph,Cycle graph,Mathematics | Journal |
Volume | Issue | ISSN |
32 | 3 | 1435-5914 |
Citations | PageRank | References |
1 | 0.40 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ralph J. Faudree | 1 | 559 | 92.90 |
| Jenö Lehel | 2 | 141 | 24.61 |
| Kiyoshi Yoshimoto | 3 | 133 | 22.65 |