Cycles through specified vertices
暂无分享,去创建一个
AbstractRecently, various authors have obtained results about the existence of long cycles in graphs with a given minimum degreed. We extend these results to the case where only some of the vertices are known to have degree at leastd, and we want to find a cycle through as many of these vertices as possible. IfG is a graph onn vertices andW is a set ofw vertices of degree at leastd, we prove that there is a cycle through at least
$$\left\lceil {\frac{w}{{\left\lceil {{n \mathord{\left/ {\vphantom {n d}} \right. \kern-\nulldelimiterspace} d}} \right\rceil - 1}}} \right\rceil $$
vertices ofW. We also find the extremal graphs for this property.
[1] G. Dirac. Some Theorems on Abstract Graphs , 1952 .
[2] Yoshimi Egawa,et al. The longest cycles in a graph G with minimum degree at least |G|/k , 1989, J. Comb. Theory, Ser. B.
[3] Noga Alon,et al. The longest cycle of a graph with a large minimal degree , 1986, J. Graph Theory.