Are all pairs of hypomorphic digraphs \(S\)-isomorphic?

DOI10.1016/j.dam.2021.08.003zbMath1494.05050OpenAlexW3193456563MaRDI QIDQ2161275

Yanyan Li

Publication date: 4 August 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.08.003

zbMATH Keywords

\(S\)-isomorphic digraphshypomorphnon-reconstructible digraph pairspasting of two cards

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• N-reconstructibility of non-reconstructible digraphs
• Hypomorphisms, orbits, and reconstruction
• A census of non-reconstructable digraphs. I: Six related families
• On the problem of reconstructing a tournament from subtournaments
• Erratum to: “The falsity of the reconstruction conjecture for tournaments”
• Graph reconstruction—a survey
• On nonreconstructable tournaments

This page was built for publication: Are all pairs of hypomorphic digraphs \(S\)-isomorphic?