On the parameterized complexity of edge-linked paths

DOI10.1007/978-3-030-19955-5_25OpenAlexW2953093860MaRDI QIDQ2330567

Fahad Panolan, Neeldhara Misra, Saket Saurabh

Publication date: 22 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-19955-5_25

zbMATH Keywords

Turing kernelizationFPTEdge Hamiltonian cycle

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

On Computing the Hamiltonian Index of Graphs ⋮ On computing the Hamiltonian index of graphs

This page was built for publication: On the parameterized complexity of edge-linked paths