Graph Hamiltonicity parameterized by proper interval deletion set

DOI10.1007/978-3-030-61792-9_9MaRDI QIDQ2081606zbMATH OpenOpenAlexFDO

Authors R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi, Petr A. Golovach

Publication date 13 October 2022

Full work available at URL https://doi.org/10.1007/978-3-030-61792-9_9

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Recommendations

• Kernelization of graph Hamiltonicity: proper \(H\)-graphs
• Kernelization of graph Hamiltonicity: proper \(H\)-graphs
• The parameterized complexity of cycle packing: indifference is not an issue
• The parameterized complexity of cycle packing: indifference is not an issue

Cited in

(2)

• A graph width perspective on partially ordered Hamiltonian paths and cycles ii: vertex and edge deletion numbers
• Quadratic kernel for cliques or trees vertex deletion

This page was built for publication: Graph Hamiltonicity parameterized by proper interval deletion set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2081606)