Hamiltonian path in K₁,t-free split graphs -- a dichotomy
From MaRDI portal
Publication:2636552
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. Our main result is a deep investigation of the structure of -free split graphs in the context of Hamiltonian path problem, and as a consequence, we obtain a polynomial-time algorithm to the Hamiltonian path problem in -free split graphs. We close this paper with the hardness result: we show that, unless P=NP, Hamiltonian path problem is NP-complete in -free split graphs by reducing from Hamiltonian cycle problem in -free split graphs. Thus this paper establishes a "thin complexity line" separating NP-complete instances and polynomial-time solvable instances.
Recommendations
- Hamiltonicity in Split Graphs - A Dichotomy
- Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy
- The Hamiltonian properties in \(K_{1,r}\)-free split graphs
- On Hamiltonian properties of \(K_{1, r}\)-free split graphs
- On the Hamiltonian and classification problems for some families of split graphs
Cited in
(4)
This page was built for publication: Hamiltonian path in \(K_{1,t}\)-free split graphs -- a dichotomy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2636552)