论文信息 - On the reconstruction of planar graphs - 字舞流文

On the reconstruction of planar graphs

We show that the planarity of a graph can be recognized from its vertex deleted subgraphs, which answers a question posed by Bondy and Hemminger in 1979. We also state some useful counting lemmas and use them to reconstruct certain planar graphs.

Xingxing Yu | Young Soo Kwon | Mark Bilinski | Xingxing Yu | Mark Bilinski

[1] The Reconstruction of Graphs , 2005, math/0503316.

[2] Michèle Bernstein. All the king's horses , 2008 .

[3] Bennet Manvel,et al. On reconstruction of graphs , 1969 .

[4] P. Kelly. A congruence theorem for trees. , 1957 .

[5] Robert L. Hemminger,et al. Graph reconstruction - a survey , 1977, J. Graph Theory.

[6] Josef Lauri,et al. Edge-reconstruction of 4-connected planar graphs , 1982, J. Graph Theory.

[7] S. Ulam. A collection of mathematical problems , 1960 .

[8] Josef Lauri. The reconstruction of maximal planar graphs II. Reconstruction , 1981, J. Comb. Theory, Ser. B.

[9] Josef Lauri,et al. The reconstruction of maximal planar graphs. I. Recognition , 1981, J. Comb. Theory, Ser. B.

[10] A. Kelso,et al. All the king's horses , 1992 .

[11] J. A. Bondy,et al. Surveys in Combinatorics, 1991: “A Graph Reconstructor's Manual” , 1991 .

[12] Claude Berge,et al. The theory of graphs and its applications , 1962 .

[13] W. Kocay,et al. Some new methods in reconstruction theory , 1982 .

[14] Reinhard Diestel,et al. Graph Theory , 1997 .

[15] S. Fiorini. A THEOREM ON PLANAR GRAPHS WITH AN APPLICATION TO THE RECONSTRUCTION PROBLEM, I , 1978 .