Geodesic
Reconstruction conjecture for graphs with restrictions for 4-vertex paths
Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 4, pp. 87-96

Voir la notice de l'article provenant de la source Math-Net.Ru

The well-known Kelly–Ulam reconstruction conjecture is considered. It is proved that the conjecture holds for $P_4$-disconnected and $P_4$-tidy graphs. In particular, it generalizes the known results on the reconstructibility of disconnected graphs, complements of disconnected graphs, 1-decomposable graphs, and $P_4$-reducible graphs. Bibl. 19.
Mots-clés : reconstruction conjecture
Keywords: $P_4$-disconnected graphs, $P_4$-tidy graphs, $P_4$-reducible graphs, 1-decomposable graphs. 
@article{DA_2009_16_4_a5,
     author = {P. V. Skums and R. I. Tyshkevich},
     title = {Reconstruction conjecture for graphs with restrictions for 4-vertex paths},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {87--96},
     publisher = {mathdoc},
     volume = {16},
     number = {4},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2009_16_4_a5/}
}
TY  - JOUR
AU  - P. V. Skums
AU  - R. I. Tyshkevich
TI  - Reconstruction conjecture for graphs with restrictions for 4-vertex paths
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2009
SP  - 87
EP  - 96
VL  - 16
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2009_16_4_a5/
LA  - ru
ID  - DA_2009_16_4_a5
ER  - 
%0 Journal Article
%A P. V. Skums
%A R. I. Tyshkevich
%T Reconstruction conjecture for graphs with restrictions for 4-vertex paths
%J Diskretnyj analiz i issledovanie operacij
%D 2009
%P 87-96
%V 16
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2009_16_4_a5/
%G ru
%F DA_2009_16_4_a5
P. V. Skums; R. I. Tyshkevich. Reconstruction conjecture for graphs with restrictions for 4-vertex paths. Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 4, pp. 87-96. http://geodesic.mathdoc.fr/item/DA_2009_16_4_a5/