Computing complete graph isomorphisms and Hamiltonian cycles from partial ones
type: Item
instance of: scholarly article
title: Computing complete graph isomorphisms and Hamiltonian cycles from partial ones
zbMATH Open document ID: 0993.68043
published in: Theory of Computing Systems
publication date: 2002-05-30T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1748013
zbMATH Keywords: Hamiltonian cycles
author: André Große
author: Jörg Rothe
author: Gerd Wechsung
MaRDI profile type: Publication
full work available at URL: s00224-001-1048-9
OpenAlex ID: W1727973222
DOI: 10.1007/S00224-001-1048-9
Recommended article: Hamiltonian decompositions of complete graphs
Recommended article: Q4838454
Recommended article: On the cycle‐isomorphism of graphs
Recommended article: Completeness results for graph isomorphism.
Recommended article: Computing graph automorphism from partial solutions
Recommended article: On Computing the Hamiltonian Index of Graphs
Recommended article: On computing the Hamiltonian index of graphs
Recommended article: Extending partial isomorphisms of graphs
Recommended article: Q4722096
Recommended article: Q3720641
description: scientific article; zbMATH DE number 1748013