SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Australasian Journal of Combinatorics

Volumn 60, Issue 2, 2014, Pages 169-190

On the edge-reconstruction number of a tree

(4) Asciak, K a Lauri, J a Myrvold, W b Pannone, V c

a UNIVERSITY OF MALTA (Malta)

b UNIVERSITY OF VICTORIA (Canada)

c UNIVERSITY OF FLORENCE (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84923539745 PISSN: 10344942 EISSN: 22023518 Source Type: Journal
DOI: None Document Type: Article

Times cited : (1)

References (17)

1
- 77958466475
- A survey of some open questions in reconstruction numbers
- K. Asciak, M.A. Francalanza, J. Lauri and W. Myrvold, A survey of some open questions in reconstruction numbers, Ars Combin. 97 (2010), 443–456.
- (2010) Ars Combin , vol.97 , pp. 443-456
- Asciak, K.¹ Francalanza, M.A.² Lauri, J.³ Myrvold, W.⁴

2
- 77955555753
- Degree-associated reconstruction number of graphs
- M.D. Barrus and D.B. West, Degree-associated reconstruction number of graphs, Discrete Math. 310 (2010), 2600–2612.
- (2010) Discrete Math , vol.310 , pp. 2600-2612
- Barrus, M.D.¹ West, D.B.²

3
- 84971180732
- On Kelly’s congruence theorem for trees, Proc. Cambridge Philos
- J.A. Bondy, On Kelly’s congruence theorem for trees, Proc. Cambridge Philos. Soc. 65 (1969), 387–397.
- (1969) Soc , vol.65 , pp. 387-397
- Bondy, J.A.¹

4
- 0039236270
- On the class-reconstruction number of trees
- F. Harary and J. Lauri, On the class-reconstruction number of trees, Quart. J. Math. Oxford (2) 39 (1988), 47–60
- (1988) Quart. J. Math. Oxford (2) , vol.39 , pp. 47-60
- Harary, F.¹ Lauri, J.²

5
- 0039089786
- On similar points of a graph
- F. Harary and E.M. Palmer, On similar points of a graph, J. Math. Mech. 15 (1966), 623–630.
- (1966) J. Math. Mech , vol.15 , pp. 623-630
- Harary, F.¹ Palmer, E.M.²

6
- 85032070732
- The graph reconstruction number
- F. Harary and M. Plantholt, The graph reconstruction number, J. Graph Theory. 9 (1985) 451–454.
- (1985) J. Graph Theory , vol.9 , pp. 451-454
- Harary, F.¹ Plantholt, M.²

7
- 0041014870
- The reconstruction of a tree from its maximal subtrees, Canad
- F. Harary and E. Palmer, The reconstruction of a tree from its maximal subtrees, Canad. J. Math. 18 (1966), 803–810.
- (1966) J. Math , vol.18 , pp. 803-810
- Harary, F.¹ Palmer, E.²

8
- 84972518116
- A congruence theorem for trees, Pacific
- P.J. Kelly, A congruence theorem for trees, Pacific J. Math. 7 (1957), 961–968.
- (1957) J. Math , vol.7 , pp. 961-968
- Kelly, P.J.¹

9
- 0041014841
- On pseudosimilarity in trees
- D.G. Kirkpatrick, M.M. Klawe and D.G. Corneil, On pseudosimilarity in trees, J. Combin. Theory Ser. B. 34 (1983), 323–339.
- (1983) J. Combin. Theory Ser. B , vol.34 , pp. 323-339
- Kirkpatrick, D.G.¹ Klawe, M.M.² Corneil, D.G.³

10
- 0039236237
- Interchanging branches and similarity in a tree
- I. Krasikov, Interchanging branches and similarity in a tree, Graphs Combin. 7 (1991), 165–175.
- (1991) Graphs Combin , vol.7 , pp. 165-175
- Krasikov, I.¹

11
- 33751168359
- Proof of Harary’s conjecture on the reconstruction of trees
- J. Lauri, Proof of Harary’s conjecture on the reconstruction of trees, Discrete Math. 43 (1983), 79–90.
- (1983) Discrete Math , vol.43 , pp. 79-90
- Lauri, J.¹

12
- 0032785515
- The advantages of forward thinking in generating rooted and free trees
- G. Li and F. Ruskey, The advantages of forward thinking in generating rooted and free trees, In 10th annual ACM-SIAM Symposium on Discrete Alogorithms (SODA). (1999).
- (1999) 10th annual ACM-SIAM Symposium on Discrete Alogorithms (SODA)
- Li, G.¹ Ruskey, F.²

13
- 84888202264
- Practical graph isomorphism {II}
- B.D. McKay, Practical graph isomorphism {II}, J. Symbolic Computation. 60 (2014), 94–112.
- (2014) J. Symbolic Computation , vol.60 , pp. 94-112
- McKay, B.D.¹ Isomorphism, P.G.²

14
- 84923562779
- The edge reconstruction number of a tree, Vishwa Internat
- R. Molina, The edge reconstruction number of a tree, Vishwa Internat. J. Graph Theory. 2 (1993), 117–130.
- (1993) J. Graph Theory , vol.2 , pp. 117-130
- Molina, R.¹

15
- 84986520387
- The ally-reconstruction number of a tree with five or more vertices is three
- W.J. Myrvold, The ally-reconstruction number of a tree with five or more vertices is three, J. Graph Theory. 14 (1990), 149–166.
- (1990) J. Graph Theory , vol.14 , pp. 149-166
- Myrvold, W.J.¹

16
- 83455210966
- D. Rivshin, Personal communication.
- Personal communication
- Rivshin, D.¹

17
- 76649127447
- Reconstructing trees from two cards
- M. Welhan, Reconstructing trees from two cards, J. Graph Theory. 63 (2010), 243–257.
- (2010) J. Graph Theory , vol.63 , pp. 243-257
- Welhan, M.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.