Computing complete graph isomorphisms and Hamiltonian cycles from partial ones (Q1597764)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing complete graph isomorphisms and Hamiltonian cycles from partial ones |
scientific article; zbMATH DE number 1748013
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing complete graph isomorphisms and Hamiltonian cycles from partial ones |
scientific article; zbMATH DE number 1748013 |
Statements
Computing complete graph isomorphisms and Hamiltonian cycles from partial ones (English)
0 references
30 May 2002
0 references
Hamiltonian cycles
0 references
0.90010226
0 references
0 references
0.88510025
0 references
0.8842306
0 references
0.8821025
0 references
0.8821025
0 references
0.8805324
0 references
