Graph reconstruction conjecture: reductions using complement, connectivity and distance
From MaRDI portal
Recommendations
- Reconstruction of bipartite graphs and triangle-free graphs with connectivity two
- A reduction of the graph reconstruction conjecture
- Reconstruction conjecture-present trends of research
- A reconstrability conjecture for graphs with restrictions for 4-vertex simple paths
- Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible
Cited in
(13)- Some work towards the proof of the reconstruction conjecture
- Reconstruction of distance hereditary 2-connected graphs
- Reconstruction and verification of chordal graphs with a distance oracle
- Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible
- A conjecture on the reconstruction of graphs from metric balls of their vertices
- A reduction of the graph reconstruction conjecture
- Reconstruction of bipartite graphs and triangle-free graphs with connectivity two
- Reconstruction conjecture-present trends of research
- A reconstrability conjecture for graphs with restrictions for 4-vertex simple paths
- scientific article; zbMATH DE number 5287238 (Why is no real title available?)
- Reconstruction of 2-connected parity graphs
- Degree associated edge reconstruction number of split graphs with biregular independent set is one
- Reconstruction and edge reconstruction of triangle-free graphs
This page was built for publication: Graph reconstruction conjecture: reductions using complement, connectivity and distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636215)
