The Hamiltonian cycle problem and monotone classes

DOI10.1007/978-3-031-63021-7_35MaRDI QIDQ7021073zbMATH OpenFDO

Authors Vadim Lozin

Publication date 28 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-63021-7_35

zbMATH Keywords

Hamiltonian cyclemonotone classpolynomial algorithm

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Boundary properties of graphs for algorithmic graph problems
• Graph minors. V. Excluding a planar graph
• Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Tree-width dichotomy

Cited in

(3)

• Graph problems and monotone classes
• Monotone classes, even graphs and the Hamiltonian cycle problem
• Complexity framework for forbidden subgraphs. II: Edge subdivision and the ``H-graphs

This page was built for publication: The Hamiltonian cycle problem and monotone classes

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