Computing complete graph isomorphisms and Hamiltonian cycles from partial ones

DOI10.1007/S00224-001-1048-9MaRDI QIDQ1597764zbMATH OpenOpenAlexFDO

Authors André Große, Jörg Rothe, Gerd Wechsung

Publication date 30 May 2002

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-001-1048-9

zbMATH Keywords

Hamiltonian cycles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Hamiltonian decompositions of complete graphs
• scientific article; zbMATH DE number 772748
• On the cycle‐isomorphism of graphs
• Completeness results for graph isomorphism.
• Computing graph automorphism from partial solutions
• On Computing the Hamiltonian Index of Graphs
• On computing the Hamiltonian index of graphs
• Extending partial isomorphisms of graphs
• Publication:4722096
• scientific article; zbMATH DE number 3950581

Cited in

(5)

• scientific article; zbMATH DE number 2044511 (Why is no real title available?)
• Functional approach to the Hamiltonian circuit and graph isomorphism problems
• Computing graph automorphism from partial solutions
• Computational complexity of computing a partial solution for the graph automorphism problems
• Minimization procedure for Hamiltonian circuit and graph isomorphism problems

This page was built for publication: Computing complete graph isomorphisms and Hamiltonian cycles from partial ones

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