Hamiltonian path in \(K_{1,t}\)-free split graphs -- a dichotomy
From MaRDI portal
Publication:2636552
DOI10.1007/978-3-319-74180-2_3zbMath1497.68394arXiv1711.09262OpenAlexW2783228594MaRDI QIDQ2636552
Publication date: 5 June 2018
Full work available at URL: https://arxiv.org/abs/1711.09262
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
This page was built for publication: Hamiltonian path in \(K_{1,t}\)-free split graphs -- a dichotomy