A reduction of the graph reconstruction conjecture

DOI10.7151/DMGT.1746MaRDI QIDQ2509541zbMATH OpenOpenAlexWikidataFDO

Authors S. Monikandan, J. Balakumar

Publication date 28 July 2014

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.1746

zbMATH Keywords

diametergeodetic graphinterval-regular graphreconstruction

Mathematics Subject Classification ID

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

Recommendations

• Graph reconstruction conjecture: reductions using complement, connectivity and distance
• Reconstruction of bipartite graphs and triangle-free graphs with connectivity two
• Reconstruction conjecture-present trends of research
• Some work towards the proof of the reconstruction conjecture
• Progress on the reconstruction conjecture

Cites work

• (0,)-graphs and n-cubes
• Geodetic blocks of diameter three
• Graph reconstruction—a survey
• scientific article; zbMATH DE number 4097430 (Why is no real title available?)
• scientific article; zbMATH DE number 3655994 (Why is no real title available?)
• scientific article; zbMATH DE number 3659633 (Why is no real title available?)
• scientific article; zbMATH DE number 3674136 (Why is no real title available?)
• scientific article; zbMATH DE number 3697163 (Why is no real title available?)
• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 1146222 (Why is no real title available?)
• scientific article; zbMATH DE number 1952951 (Why is no real title available?)
• scientific article; zbMATH DE number 2200042 (Why is no real title available?)
• scientific article; zbMATH DE number 3258862 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Nearly acyclic graphs are reconstructible
• Some work towards the proof of the reconstruction conjecture
• The reconstruction conjecture is true if all 2-connected graphs are reconstructible
• The reconstruction of maximal planar graphs. I: Recognition
• The reconstruction of maximal planar graphs. II: Reconstruction
• The reconstruction of outerplanar graphs

Cited in

(16)

• A new reduction rule for the connection graph proof procedure
• The reduction of graph families closed under contraction
• Some work towards the proof of the reconstruction conjecture
• Reconstruction of distance hereditary 2-connected graphs
• A method of graph reduction and its applications
• A conjecture on the reconstruction of graphs from metric balls of their vertices
• Reconstruction of bipartite graphs and triangle-free graphs with connectivity two
• Reconstruction conjecture-present trends of research
• scientific article; zbMATH DE number 5287238 (Why is no real title available?)
• Graph reconstruction conjecture: reductions using complement, connectivity and distance
• scientific article; zbMATH DE number 4023330 (Why is no real title available?)
• scientific article; zbMATH DE number 177426 (Why is no real title available?)
• scientific article; zbMATH DE number 177462 (Why is no real title available?)
• Reconstruction of 2-connected parity graphs
• On the reduction of Yutsis graphs
• Reconstructing graphs from cut-set sizes

This page was built for publication: A reduction of the graph reconstruction conjecture

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