Reconstructing graphs from their k-edge deleted subgraphs

DOI10.1016/0095-8956(87)90013-XzbMath0595.05050OpenAlexW2167155956MaRDI QIDQ1077434

Yehuda Roditty, Chris D. Godsil, Ilia Krasikov

Publication date: 1987

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(87)90013-x

zbMATH Keywords

graph reconstructionk-edge deleted subgraphs

Mathematics Subject Classification ID

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

Related Items (10)

Balance equations for reconstruction problems ⋮ Finite-type invariants for graphs and graph reconstructions ⋮ A survey on edge reconstruction of graphs ⋮ Combinatorial reconstruction problems ⋮ Inclusion matrices for rainbow subsets ⋮ Unique representability and matroid reconstruction ⋮ Vertex-switching reconstruction of subgraph numbers and triangle-free graphs ⋮ The \(k\)-orbit reconstruction and the orbit algebra ⋮ A reconstruction problem related to balance equations. II: The general case ⋮ Some results and approaches for reconstruction conjectures

Cites Work

• Unnamed Item
• Quotients of Peck posets
• Reconstruction from vertex-switching
• Balance equations for reconstruction problems
• The edge reconstruction hypothesis is true for graphs with more than n log n edges
• On the number of sets in a null t-design
• A note on the line reconstruction problem
• On the Structure oft-Designs
• Graph reconstruction—a survey

This page was built for publication: Reconstructing graphs from their k-edge deleted subgraphs