The edge reconstruction hypothesis is true for graphs with more than \(n\cdot \log_2\,n\) edges

DOI10.1016/0095-8956(77)90074-0zbMath0319.05127OpenAlexW2040590647MaRDI QIDQ1222665

Vladimír Müller

Publication date: 1977

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(77)90074-0

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (2)

A reconstruction problem related to balance equations ⋮ Graph theory (algorithmic, algebraic, and metric problems)

Cites Work

• A congruence theorem for trees
• A note on the line reconstruction problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The edge reconstruction hypothesis is true for graphs with more than \(n\cdot \log_2\,n\) edges