Long cycles in certain graphs of large degree

Autor: Pak-Ken Wong
Jazyk: angličtina
Rok vydání: 2000
Předmět:
Zdroj: International Journal of Mathematics and Mathematical Sciences, Vol 24, Iss 10, Pp 691-697 (2000)
Druh dokumentu: article
ISSN: 0161-1712
1687-0425
01611712
DOI: 10.1155/S0161171200003653
Popis: 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 complexity of this algorithm is O(n2). In case G is 2-connected, the condition |X|≥3 can be removed and G is hamiltonian.
Databáze: Directory of Open Access Journals
Externí odkaz: