Balance equations for reconstruction problems

DOI10.1007/BF01189639zbMath0594.05049OpenAlexW2047947303MaRDI QIDQ1076692

Ilia Krasikov, Yehuda Roditty

Publication date: 1987

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01189639

zbMATH Keywords

sufficient conditionsreconstruction problemscounting techniqueedge- reconstructionvertex switching reconstruction

Mathematics Subject Classification ID

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

Related Items (13)

Reconstructing graphs from their k-edge deleted subgraphs ⋮ Finite-type invariants for graphs and graph reconstructions ⋮ A survey on edge reconstruction of graphs ⋮ Combinatorial reconstruction problems ⋮ Vertex-switching, isomorphism, and pseudosimilarity ⋮ A reconstruction problem related to balance equations ⋮ Degree conditions for vertex switching reconstruction ⋮ Vertex-switching reconstruction of subgraph numbers and triangle-free graphs ⋮ Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture ⋮ Switching reconstruction and diophantine equations ⋮ The \(k\)-orbit reconstruction and the orbit algebra ⋮ Switching reconstruction of digraphs ⋮ A reconstruction problem related to balance equations. II: The general case

Cites Work

• Unnamed Item
• Reconstruction from vertex-switching
• Reconstructing graphs from their k-edge deleted subgraphs
• The edge reconstruction hypothesis is true for graphs with more than n log n edges
• A note on the line reconstruction problem

This page was built for publication: Balance equations for reconstruction problems