Kernelization of graph Hamiltonicity: proper H-graphs

DOI10.1007/978-3-030-24766-9_22MaRDI QIDQ2285097zbMATH OpenOpenAlexFDO

Authors Steven Chaplick, Fedor V. Fomin, Dušan Knop, Peter Zeman, Petr A. Golovach

Publication date 16 January 2020

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

zbMATH Keywords

path coverkernelizationcycle coverproper \(H\)-graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parameterized complexity, tractability and kernelization (68Q27)

Recommendations

• Kernelization of graph Hamiltonicity: proper \(H\)-graphs
• Kernel bounds for path and cycle problems
• Kernel bounds for path and cycle problems

Cited in

(4)

• Approximate Turing Kernelization for Problems Parameterized by Treewidth
• Recognizing Proper Tree-Graphs
• Kernelization of graph Hamiltonicity: proper \(H\)-graphs
• Graph Hamiltonicity parameterized by proper interval deletion set

This page was built for publication: Kernelization of graph Hamiltonicity: proper \(H\)-graphs

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