Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Bondy, J. A.
1969.
On Kelly's congruence theorem for trees.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 65,
Issue. 2,
p.
387.
Greenwell, D. L.
and
Hemminger, R. L.
1969.
The Many Facets of Graph Theory.
Vol. 110,
Issue. ,
p.
91.
Hemminger, Robert L.
1969.
On reconstructing a graph.
Proceedings of the American Mathematical Society,
Vol. 20,
Issue. 1,
p.
185.
Bondy, J.A.
1969.
On the reconstruction of a graph from its closure function.
Journal of Combinatorial Theory,
Vol. 7,
Issue. 3,
p.
221.
Manvel, Bennet
1969.
The Many Facets of Graph Theory.
Vol. 110,
Issue. ,
p.
207.
Capobianco, Michael F.
1970.
Section of Mathematics: STATISTICAL INFERENCE IN FINITE POPULATIONS HAVING STRUCTURE*.
Transactions of the New York Academy of Sciences,
Vol. 32,
Issue. 4 Series II,
p.
401.
O'Neil, P. V.
1970.
Ulam's Conjecture and Graph Reconstructions.
The American Mathematical Monthly,
Vol. 77,
Issue. 1,
p.
35.
Manvel, Bennet
and
Stockmeyer, Paul K.
1971.
On Reconstruction of Matrices.
Mathematics Magazine,
Vol. 44,
Issue. 4,
p.
218.
Manvel, Bennet
1972.
Reconstruction of maximal outerplanar graphs.
Discrete Mathematics,
Vol. 2,
Issue. 3,
p.
269.
Manvel, Bennet
1973.
Reconstructing the degree pair sequence of a digraph.
Journal of Combinatorial Theory, Series B,
Vol. 15,
Issue. 1,
p.
18.
Giles, William B
1974.
The reconstruction of outerplanar graphs.
Journal of Combinatorial Theory, Series B,
Vol. 16,
Issue. 3,
p.
215.
Harary, Frank
1974.
Graphs and Combinatorics.
Vol. 406,
Issue. ,
p.
18.
Giles, William B.
1976.
Reconstructing trees from two point deleted subtrees.
Discrete Mathematics,
Vol. 15,
Issue. 4,
p.
325.
Bondy, J. A.
and
Hemminger, R. L.
1977.
Graph reconstruction—a survey.
Journal of Graph Theory,
Vol. 1,
Issue. 3,
p.
227.
Schmieder, R.
1979.
Bemerkungen zu einem Isomorphie‐Problem für Graphen, die speziellen Matrizen zugeordnet sind.
Mathematische Nachrichten,
Vol. 90,
Issue. 1,
p.
213.
Kundu, Sukhamay
Sampathkumar, E.
Shearer, James
and
Sturtevant, Dean
1980.
Reconstruction of a Pair of Graphs from their Concatenations.
SIAM Journal on Algebraic Discrete Methods,
Vol. 1,
Issue. 2,
p.
228.
Lauri, J.
1983.
Proof of Harary's conjecture on the reconstruction of trees.
Discrete Mathematics,
Vol. 43,
Issue. 1,
p.
79.
Winter, P. A.
and
Swart, H. C.
1984.
ON α,β DESTRUCTIBLE GRAPHS.
Quaestiones Mathematicae,
Vol. 7,
Issue. 2,
p.
161.
Gupta, S. K.
1984.
Graph Theory Singapore 1983.
Vol. 1073,
Issue. ,
p.
268.
Krasikov, I
and
Schönheim, J
1985.
The reconstruction of a tree from its number deck.
Discrete Mathematics,
Vol. 53,
Issue. ,
p.
137.