Hypomorphisms, orbits, and reconstruction

DOI10.1016/0095-8956(88)90087-1zbMath0595.05051OpenAlexW2988984088MaRDI QIDQ1077435

William L. Kocay

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90087-1

zbMATH Keywords

orbitsreconstruction conjecturehypomorphismgraph reconstructionhypomorphic graphspartial automorphism

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Are all pairs of hypomorphic digraphs \(S\)-isomorphic? ⋮ A property of most of the known non-reconstructible digraphs ⋮ Reconstruction of locally finite connected graphs with two infinite wings

Cites Work

• A family of non-reconstructible hypergraphs
• A census of non-reconstructable digraphs. I: Six related families
• On Stockmeyer's non-reconstructible tournaments
• The falsity of the reconstruction conjecture for tournaments
• Graph reconstruction—a survey
• On the reconstruction of a graph from its closure function
• Unnamed Item
• Unnamed Item

This page was built for publication: Hypomorphisms, orbits, and reconstruction