Hamiltonian results in K1,3‐free graphs
Manton M. Matthews, David P. Sumner · Journal of Graph Theory · 1984
Abstract There have been a number of results dealing with Hamiltonian properties in powers of graphs. In this paper we show that the square and the total graph of a K1,3‐free graph are vertex pancyclic. We then discuss some of the relationships between connectivity and Hamiltonian properties in K1,3‐free graphs.