|
|||||
|
|
A short proof of Meyniel's theorem |
|
| Authors: | J.A. Bondy C. Thomassen |
| Affiliation: | Odense University, Odense, Denmark;University of Waterloo, Waterloo, Ontario, Canada |
| Abstract: | Meyniel's theorem states that a strict diconnected digraph has a directed Hamilton cycle if d(u) + d(v) ? 2n ? 1 for every pair u, v of nonadjacent vertices. We give short proof of this theorem. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |