The reconstruction of maximal planar graphs. I. Recognition
暂无分享，去创建一个
Abstract The object of this paper is to show that every maximal planar graph is recognizable from its family of vertex-deleted subgraphs.
[1] H. Whitney. Congruent Graphs and the Connectivity of Graphs , 1932 .
[2] Frank Harary,et al. Graph Theory , 2016 .
[3] Robert L. Hemminger,et al. Graph reconstruction - a survey , 1977, J. Graph Theory.
[4] Gary Chartrand,et al. Critically $n$-connected graphs , 1972 .