Computing complete graph isomorphisms and Hamiltonian cycles from partial ones
From MaRDI portal
Publication:1597764
DOI10.1007/S00224-001-1048-9zbMATH Open0993.68043OpenAlexW1727973222MaRDI QIDQ1597764FDOQ1597764
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
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (5)
- Title not available (Why is that?)
- 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)
