The centroidal branches of a separable graph are edge reconstructible

DOI10.1016/S0012-365X(97)00032-0zbMath0885.05089MaRDI QIDQ1377714

Robert R. Molina

Publication date: 24 March 1998

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

zbMATH Keywords

graph reconstructiongraph reconstruction conjectureedge reconstruction

Mathematics Subject Classification ID

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

Cites Work

• On Ulam's conjecture for separable graphs
• The ally-reconstruction number of a tree with five or more vertices is three
• The reconstruction conjecture is true if all 2-connected graphs are reconstructible
• Graph reconstruction—a survey
• Unnamed Item
• Unnamed Item

This page was built for publication: The centroidal branches of a separable graph are edge reconstructible