Reconstruction of bipartite graphs and triangle-free graphs with connectivity two
zbMATH Open1256.05154MaRDI QIDQ2906851FDOQ2906851
Authors: S. Monikandan, J. Balakumar 
Publication date: 5 September 2012
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/53/ajc_v53_p141.pdf
Recommendations
- Graph reconstruction conjecture: reductions using complement, connectivity and distance
- Reconstruction of distance hereditary 2-connected graphs
- Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible
- A reduction of the graph reconstruction conjecture
- Reconstruction of 2-connected parity graphs
diameterreconstruction conjecturetriangle free graphsreconstructible graphsconnectivity twoone-vertex deleted unlabeled subgraphs
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Connectivity (05C40) Structural characterization of families of graphs (05C75)
Cited In (7)
- Some work towards the proof of the reconstruction conjecture
- Reconstruction of distance hereditary 2-connected graphs
- Graph reconstruction conjecture: reductions using complement, connectivity and distance
- Title not available (Why is that?)
- Reconstruction and edge reconstruction of triangle-free graphs
- Bipartite operator decomposition of graphs and the reconstruction conjecture
- Bipartite permutation graphs are reconstructible
This page was built for publication: Reconstruction of bipartite graphs and triangle-free graphs with connectivity two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906851)
