|
|||||
|
|
A lower bound for the circumference of a graph |
|
| Authors: | Nathan Linial |
| Institution: | Department of Mathematics, Technion, Israel Institute of Technology, Haifa, Israel |
| Abstract: | Let G=(V, E) be a block of order n, different from Kn. Let m=min {d(x)+d(y): x, y]?E}. We show that if m?n then G contains a cycle of length at least m. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |