Long cycles in certain graphs of large degree
Let G be a connected graph of order n and X={x∈V:d(x)≥n/2}. Suppose |X|≥3 and G satisfies the modified Fan's condition. We show that the vertices of the block B of G containing X form a cycle. This generalizes a result of Fan. We also give an efficient algorithm to obtain such a cycle. The co...
| Автор: | |
|---|---|
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Hindawi Limited
2000-01-01
|
| Серія: | International Journal of Mathematics and Mathematical Sciences |
| Предмети: | |
| Онлайн доступ: | http://dx.doi.org/10.1155/S0161171200003653 |