Minimization procedure for Hamiltonian circuit and graph isomorphism problems

MaRDI QIDQ5147396zbMATHFDO

Authors R. T. Faizullin

Publication date 26 January 2021

Full work available at URL http://mathnet.ru/eng/pdm194

zbMATH Keywords

graph isomorphism problemHamiltonian circuit problem

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Functional approach to the Hamiltonian circuit and graph isomorphism problems
• Some recognition problems related to graph isomorphism
• Reduced-by-matching graphs: toward simplifying Hamiltonian circuit problem
• Computing complete graph isomorphisms and Hamiltonian cycles from partial ones
• Minimum circuit size, graph isomorphism, and related problems

Cited in

(4)

• A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
• scientific article; zbMATH DE number 4068311 (Why is no real title available?)
• Functional approach to the Hamiltonian circuit and graph isomorphism problems
• Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem

This page was built for publication: Minimization procedure for Hamiltonian circuit and graph isomorphism problems

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