메뉴 건너뛰기




Volumn 63, Issue 2, 2010, Pages 146-163

Families of Pairs of graphs with a large number of common cards

Author keywords

Card; Counter examples; Examples; Reconstruction conjecture; Reconstruction number; Vertex deleted subgraph

Indexed keywords

FORESTRY; GRAPHIC METHODS;

EID: 73849107846     PISSN: 03649024     EISSN: 10970118     Source Type: Journal    
DOI: 10.1002/jgt.20415     Document Type: Article
Times cited : (17)

References (30)
  • 1
    • 85168546404 scopus 로고    scopus 로고
    • On a disconnected graph with large reconstruction number
    • K. Asciak and J. Lauri, On a disconnected graph with large reconstruction number, Ars Combin 62 (2003), 197-211.
    • (2003) Ars Combin , vol.62 , pp. 197-211
    • Asciak, K.1    Lauri, J.2
  • 2
    • 73849135090 scopus 로고    scopus 로고
    • M.Sc. Dissertation, Rochester Institute of Technology
    • J. Baldwin, Graph reconstruction numbers, M.Sc. Dissertation, Rochester Institute of Technology, 2004.
    • (2004) Graph reconstruction numbers
    • Baldwin, J.1
  • 3
    • 84986527737 scopus 로고
    • Almost every graph has reconstruction number three
    • B. Bollobás, Almost every graph has reconstruction number three, J Graph Theory 14(1) (1990), 1-4.
    • (1990) J Graph Theory , vol.14 , Issue.1 , pp. 1-4
    • Bollobás, B.1
  • 5
    • 0000805569 scopus 로고
    • A graph reconstructor's manual, Surveys in Combinatorics
    • Cambridge University Press, Cambridge
    • J. A. Bondy, A graph reconstructor's manual, Surveys in Combinatorics, London Mathematics Society Lecture Notes Series 166, Cambridge University Press, Cambridge, 1991, pp. 221-252.
    • (1991) London Mathematics Society Lecture Notes Series , vol.166 , pp. 221-252
    • Bondy, J.A.1
  • 6
    • 0001717418 scopus 로고
    • Graph reconstruction-a survey
    • J. A. Bondy and R. L. Hemminger, Graph reconstruction-a survey, J Graph Theory 1 (1977), 227-268.
    • (1977) J Graph Theory , vol.1 , pp. 227-268
    • Bondy, J.A.1    Hemminger, R.L.2
  • 9
    • 0042592122 scopus 로고
    • Reconstructing graphs, The Many Facets of Graph Theory
    • Springer-Verlag, Heidelberg
    • R. L Greenwell and R. L Hemminger, Reconstructing graphs, The Many Facets of Graph Theory, Lecture Notes in Mathematics, Springer-Verlag, Heidelberg, 1968, pp. 91-114.
    • (1968) Lecture Notes in Mathematics , pp. 91-114
    • Greenwell, R.L.1    Hemminger, R.L.2
  • 10
    • 84963056434 scopus 로고
    • On representatives of subsets
    • P. Hall, On representatives of subsets, J London Math Soc 10 (1935), 26-30.
    • (1935) J London Math Soc , vol.10 , pp. 26-30
    • Hall, P.1
  • 13
    • 84972518116 scopus 로고
    • A congruence theorem for trees
    • P. J. Kelly, A congruence theorem for trees, Pacific J Math 7 (1957), 961-968.
    • (1957) Pacific J Math , vol.7 , pp. 961-968
    • Kelly, P.J.1
  • 14
    • 34447320813 scopus 로고
    • The reconstruction of maximal planar graphs
    • J. Lauri, The reconstruction of maximal planar graphs, J Combin Theory (Ser B) 30 (1981), 196-214.
    • (1981) J Combin Theory (Ser B) , vol.30 , pp. 196-214
    • Lauri, J.1
  • 19
    • 73849127946 scopus 로고    scopus 로고
    • B. D. McKay, Nauty user's guide (version 1.5), Technical Report TR.CS-90-02, Department of Computer Science, Australia National University, 1990.
    • B. D. McKay, Nauty user's guide (version 1.5), Technical Report TR.CS-90-02, Department of Computer Science, Australia National University, 1990.
  • 20
    • 0042750653 scopus 로고    scopus 로고
    • Small graphs are reconstructible
    • B. D. McKay, Small graphs are reconstructible, Australas J Combin (1997), 123-126.
    • (1997) Australas J Combin , pp. 123-126
    • McKay, B.D.1
  • 21
    • 73849083677 scopus 로고    scopus 로고
    • M.Sc. Thesis, Rochester Institute of Technology
    • B. McMullen, Reconstruction numbers, M.Sc. Thesis, Rochester Institute of Technology, 2005.
    • (2005) Reconstruction numbers
    • McMullen, B.1
  • 22
    • 0142115250 scopus 로고
    • Correction of a proof on the ally reconstruction number of a disconnected graph
    • R. Molina, Correction of a proof on the ally reconstruction number of a disconnected graph, Ars Combin 40 (1995), 59-64.
    • (1995) Ars Combin , vol.40 , pp. 59-64
    • Molina, R.1
  • 24
    • 0043225835 scopus 로고
    • The ally reconstruction number of a disconnected graph
    • W. Myrvold, The ally reconstruction number of a disconnected graph, Ars Combin 28 (1989), 123-127.
    • (1989) Ars Combin , vol.28 , pp. 123-127
    • Myrvold, W.1
  • 25
    • 44049117612 scopus 로고
    • The degree sequence is reconstructible from n- 1 Cards
    • W. Myrvold, The degree sequence is reconstructible from n- 1 Cards, Discrete Math 102 (1990), 187-196.
    • (1990) Discrete Math , vol.102 , pp. 187-196
    • Myrvold, W.1
  • 26
    • 84986520387 scopus 로고
    • The ally reconstruction number of a tree with five or more vertices is three
    • W. Myrvold, The ally reconstruction number of a tree with five or more vertices is three, J Graph Theory 14(2) (1990), 149-166.
    • (1990) J Graph Theory , vol.14 , Issue.2 , pp. 149-166
    • Myrvold, W.1
  • 28
    • 0000537710 scopus 로고
    • On dichromatic polynomials
    • W. T. Tutte, On dichromatic polynomials, J Combin Theory 2 (1967), 310-320.
    • (1967) J Combin Theory , vol.2 , pp. 310-320
    • Tutte, W.T.1
  • 29
    • 0002405560 scopus 로고    scopus 로고
    • Oxford Science Publications, Clarendon Press, Oxford
    • W. T. Tutte, Graph Theory As I Have Known It, Oxford Science Publications, Clarendon Press, Oxford, 1998.
    • (1998) Graph Theory As I Have Known It
    • Tutte, W.T.1


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