Monotone classes, even graphs and the Hamiltonian cycle problem

DOI10.1007/978-3-031-98740-3_9MaRDI QIDQ6876409zbMATH OpenFDO

Authors Vadim Lozin

Publication date 13 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-98740-3_9

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
• Graph problems and monotone classes
• Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• The Hamiltonian cycle problem and monotone classes
• The Planar Hamiltonian Circuit Problem is NP-Complete

This page was built for publication: Monotone classes, even graphs and the Hamiltonian cycle problem

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