|
|||||
|
|
Degree Sums and Covering Cycles |
|
| Authors: | Hikoe Enomoto Atsushi Kaneko Mekkia Kouider Zsolt Tuza |
| Abstract: | It is shown that if in a simple graph G of order n the sum of degrees of any three pairwise non-adjacent vertices is at least n, then there are two cycles (or one cycle and an edge or a vertex) of GF that contain all the vertices. © 1995 John Wiley & Sons, Inc. |
| Keywords: | |