Reconstruction of distance hereditary 2-connected graphs
type: Item
instance of: scholarly article
title: Reconstruction of distance hereditary 2-connected graphs
zbMATH Open document ID: 1388.05102
author: P. Devi Priya
author: S. Monikandan
published in: Discrete Mathematics
publication date: 2018-06-07T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 6882086
zbMATH Keywords: reconstruction
zbMATH Keywords: connectivity
zbMATH Keywords: distance
MaRDI profile type: Publication
full work available at URL: j.disc.2018.05.003
OpenAlex ID: W2806411236
cites work: Powers of distance-hereditary graphs
cites work: Distance-hereditary graphs
cites work: Q3682518
cites work: Q3975132
cites work: Graph reconstruction—a survey
cites work: Q3797229
cites work: Q4692391
cites work: Q4386292
cites work: Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
cites work: Some work towards the proof of the reconstruction conjecture
cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
cites work: A characterization of ptolemaic graphs
cites work: Q4414312
cites work: Q3824449
cites work: Q4349617
cites work: Reconstruction of bipartite graphs and triangle-free graphs with connectivity two
cites work: A reduction of the graph reconstruction conjecture
cites work: Q3636215
cites work: The falsity of the reconstruction conjecture for tournaments
cites work: Centers and medians of distance-hereditary graphs
cites work: The reconstruction conjecture is true if all 2-connected graphs are reconstructible
DOI: 10.1016/J.DISC.2018.05.003
description: scientific article; zbMATH DE number 6882086