-
1
-
-
85168546404
-
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
-
-
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
-
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
-
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
-
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
-
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
-
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
-
11
-
-
84910571507
-
The reconstruction conjecture for labelled graphs
-
R. K. Guy, H. Hanani, N. Sauer and J. Schonheim, Eds, Gordon and Breach, New York
-
F. Harary and B. Manvel, The reconstruction conjecture for labelled graphs, In: Combinatorial Structures and Their Applications, Proceedings of the Calgary International Conference on Combinatorial Structures and their Structures and their Applications, Calgary, Alberta, 1969 (R. K. Guy, H. Hanani, N. Sauer and J. Schonheim, Eds.), Gordon and Breach, New York, 1970, pp. 131-146.
-
(1969)
Combinatorial Structures and Their Applications, Proceedings of the Calgary International Conference on Combinatorial Structures and their Structures and their Applications, Calgary, Alberta
, pp. 131-146
-
-
Harary, F.1
Manvel, B.2
-
13
-
-
84972518116
-
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
-
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
-
-
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
-
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
-
-
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
-
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
-
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
-
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
-
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
-
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
-
-
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
|