Longest paths and cycles in K1,3-free graphs

In this article we show that the standard results concerning longest paths and cycles in graphs can be improved for K_1,3-free graphs. We obtain as a consequence of these results conditions for the existence of a hamiltonian path and cycle in K_1,3-free graphs.