Kernelization of graph Hamiltonicity: proper \(H\)-graphs

DOI10.1007/978-3-030-24766-9_22zbMath1476.68197OpenAlexW2965852709MaRDI QIDQ2285097

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

Related Items (3)

Approximate Turing Kernelization for Problems Parameterized by Treewidth ⋮ Recognizing Proper Tree-Graphs ⋮ Kernelization of Graph Hamiltonicity: Proper $H$-Graphs

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