Reconstructing trees from two cards

Journal of Graph Theory

Volumn 63, Issue 3, 2010, Pages 243-257

  Welhan, Manuel ^a  

^a UNIVERSITY OF IDAHO   (United States)

Author keywords

Graph theory; Reconstruction; Trees

Indexed keywords

GRAPH THEORY; IMAGE RECONSTRUCTION; TECHNOLOGY TRANSFER;

SUBGRAPHS; TREES;

TREES (MATHEMATICS);

EID: 76649127447     PISSN: 03649024     EISSN: 10970118     Source Type: Journal    
DOI: 10.1002/jgt.20424     Document Type: Article

References (11)

1. J. A. Bondy, On Kelly's congruence theorem for trees, Math Proc Cambridge Philos Soc 65 (1969), 387-397.
2. J. A. Bondy and R. L. Hemminger, Graph reconstruction - A survey, J Graph Theory 1 (1977), 227-268.
3. F. Harary and J. Lauri, On the class reconstruction number of trees, Quart J Math Oxford 39 (1988), 47-60.
4. F. Harary and E. M. Palmer, The reconstruction of a tree from its maximal subtrees, Canad J Math 18 (1966), 803-810.
5. P. J. Kelly, A congruence theorem for trees, Pacific J Math 7 (1957), 961-968.
6. J. Lauri, Proof of Harary's conjecture on the reconstruction of trees, Discrete Math 43 (1983), 77-90.
7. D. G. Kirkpatrick, M. M. Klawe, and D. G. Corneil, On pseudosimilarity in trees, J Combin Theory Ser B 34 (1983), 323-339.
8. I. Krasikov, Switching branches and similarity in a tree, Graphs Combin 7 (1991), 165-175.
9. B. Manvel, Reconstruction of trees, Canad J Math 22 (1970), 55-60.
10. W. Myrvold, The ally-reconstruction number of a tree with five or more vertices is three, J Graph Theory 14 (1990), 149-166.
11. G. Prins, The automorphism group of a tree, Doctoral dissertation, University of Michigan, 1957.