Longest paths and cycles in K 1,3 ‐free graphs
Manton M. Matthews, David P. Sumner · Journal of Graph Theory · 1985
Abstract 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.