Reconstruction of 2-connected parity graphs
From MaRDI portal
Publication:5000297
zbMATH Open1468.05134MaRDI QIDQ5000297FDOQ5000297
Authors: P. Devi Priya, S. Monikandan 
Publication date: 12 July 2021
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/80/ajc_v80_p167.pdf
Recommendations
- Reconstruction of distance hereditary 2-connected graphs
- Reconstruction of bipartite graphs and triangle-free graphs with connectivity two
- Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible
- scientific article; zbMATH DE number 5914899
- All graphs are set reconstructible if all 2-connected graphs are set reconstructible.
Cites Work
- Title not available (Why is that?)
- The falsity of the reconstruction conjecture for tournaments
- Title not available (Why is that?)
- Graph reconstruction—a survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A reduction of the graph reconstruction conjecture
- The reconstruction conjecture is true if all 2-connected graphs are reconstructible
- Some work towards the proof of the reconstruction conjecture
- Reconstruction of distance hereditary 2-connected graphs
- Reconstruction of bipartite graphs and triangle-free graphs with connectivity two
- Graph reconstruction conjecture: reductions using complement, connectivity and distance
Cited In (4)
This page was built for publication: Reconstruction of 2-connected parity graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000297)
