Minimization procedure for Hamiltonian circuit and graph isomorphism problems

zbMATH Open1476.05139MaRDI QIDQ5147396FDOQ5147396

Authors: R. T. Faizullin 

Publication date: 26 January 2021

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

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

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)

Cited In (4)

• Functional approach to the Hamiltonian circuit and graph isomorphism problems
• A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
• Title not available (Why is that?)
• 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)