On the edge-reconstruction number of disconnected graphs

MaRDI QIDQ2918409zbMATH OpenFDO

Authors Kevin J. Asciak, Josef Lauri

Publication date 6 October 2012

Published in Bulletin of the Institute of Combinatorics and its Applications (Search for Journal in Brave)

zbMATH Keywords

graph isomorphismedge-deleted subgraphsedghe-reconstruction number

Mathematics Subject Classification ID

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

Recommendations

• The edge reconstruction number of a disconnected graph
• scientific article; zbMATH DE number 871166
• scientific article; zbMATH DE number 2188393
• The graph reconstruction number
• On the edge-reconstruction number of a tree

Cited in

(8)

• Reconstruction and edge reconstruction of triangle-free graphs
• scientific article; zbMATH DE number 2188393 (Why is no real title available?)
• On the edge reconstruction of locally finite disconnected graphs with a finite number of components
• On the edge-reconstruction number of a tree
• scientific article; zbMATH DE number 2028636 (Why is no real title available?)
• scientific article; zbMATH DE number 1894958 (Why is no real title available?)
• scientific article; zbMATH DE number 4154485 (Why is no real title available?)
• scientific article; zbMATH DE number 5077152 (Why is no real title available?)

This page was built for publication: On the edge-reconstruction number of disconnected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2918409)