scientific article; zbMATH DE number 617594

MaRDI QIDQ4301919zbMATH OpenFDO

Authors Alice M. Dean

Publication date 27 November 1994

zbMATH Keywords

computational complexitydecision problemshamiltonian-connected graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Hamiltonian index is NP-complete
• Complexity of the hamiltonian cycle in regular graph problem
• scientific article; zbMATH DE number 867696
• On the complexity of determining whether there is a unique Hamiltonian cycle or path

Cited in

(6)

• Disjoint path covers joining prescribed source and sink sets in interval graphs
• scientific article; zbMATH DE number 5999585 (Why is no real title available?)
• On the complexity of determining whether there is a unique Hamiltonian cycle or path
• Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
• Hamiltonian index is NP-complete
• On Hamilton-connectivity and detour index of certain families of convex polytopes

This page was built for publication:

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