Hamiltonian path in K1,t -free Split Graphs- A dichotomy

Abstract

In this paper, we investigate Hamiltonian path problem in the context of split graphs and produce a dichotomy result on the complexity of the problem. That is, unless P = NP, Hamiltonian path problem has no polynomial-time solution in K1,5 -free split graphs and polynomial-time solvable in K1,4 -free split graphs.