scientific article; zbMATH DE number 1146222
From MaRDI portal
Publication:4386292
zbMath0895.05044MaRDI QIDQ4386292
Publication date: 6 September 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (12)
Reconstruction of distance hereditary 2-connected graphs ⋮ Reconstructing under group actions. ⋮ Unnamed Item ⋮ Reconstruction number of graphs with unique pendant vertex ⋮ Stories about groups and sequences ⋮ Reconstructing compositions ⋮ Reconstructing infinite sets of integers ⋮ Efficient reconstruction of partitions ⋮ Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible ⋮ A reduction of the graph reconstruction conjecture ⋮ Reconstructing subsets of \(\mathbb{Z}_n\) ⋮ Reconstructing Young tableaux
This page was built for publication:
