On the edge-reconstruction number of disconnected graphs

zbMATH Open1251.05107MaRDI QIDQ2918409FDOQ2918409

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)

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

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)

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the edge-reconstruction number of a tree
• Reconstruction and edge reconstruction of triangle-free graphs
• On the edge reconstruction of locally finite disconnected graphs with a finite number of components
• Title not available (Why is that?)

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)