A Note on the Line Reconstruction Problem
Part of the Modern Birkhäuser Classics book series (MBC)
As in Harary’s book , graph means finite, undirected graph without loops or multiple lines. V(G) and E(G) denote the sets of points and lines of G, respectively.
KeywordsGraph Theory Mathematical Logic Number Theory Mathematical Problem Undirected Graph
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
- 1.D. L. Greenwell, Reconstructing graphs, Proc. Amer. Math. Soc. 30 (1971), 431–433.Google Scholar
- 2.D. L. Greenwell and R. L. Hemminger, Reconstructing graphs, “The Many Facets of Graph Theory” (G. T. Chartrand and S. F. Kapoor, eds.), Springer-Verlag, New York, 1969.Google Scholar
- 3.F. Harary, On the reconstruction of a graph from a collection of subgraphs, “Theory of Graphs and Its Applications” (M. Fiedler, ed.), Czechoslovak Academy of Sciences, Prague/Academic Press, New York, 1965, pp. 47–52.Google Scholar
- 4.F. Harary, “Graph Theory,” Addison-Wesley, Reading, Mass., 1969.Google Scholar
- 5.F. Harary and B. Manvel, The reconstruction conjecture for labeled graphs, “Combinatorial Structures and Their Applications” (R. K. Guy, ed.), Gordon & Breach, New York, 1969.Google Scholar
© Birkhäuser Boston, a part of Springer Science+Business Media, LLC 2009