Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Manvel, Bennet
1969.
The Many Facets of Graph Theory.
Vol. 110,
Issue. ,
p.
207.
Manvel, Bennet
and
Stockmeyer, Paul K.
1971.
On Reconstruction of Matrices.
Mathematics Magazine,
Vol. 44,
Issue. 4,
p.
218.
D�rfler, Willibald
1972.
Bemerkungen zur Ulam-Vermutung.
Archiv der Mathematik,
Vol. 23,
Issue. 1,
p.
442.
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.
Arjomandi, E.
and
Corneil, D. G.
1974.
Unicyclic Graphs Satisfy Harary′s Conjecture.
Canadian Mathematical Bulletin,
Vol. 17,
Issue. 4,
p.
593.
Giles, William B.
1974.
On reconstructing maximal outerplanar graphs.
Discrete Mathematics,
Vol. 8,
Issue. 2,
p.
169.
Kundu, Sukhamay
Sampathkumar, E
and
Bhave, V.N
1976.
Reconstruction of a tree from its homomorphic images and other related transforms.
Journal of Combinatorial Theory, Series B,
Vol. 20,
Issue. 2,
p.
117.
Giles, William B.
1976.
Reconstructing trees from two point deleted subtrees.
Discrete Mathematics,
Vol. 15,
Issue. 4,
p.
325.
Manvel, Bennet
1976.
On reconstructing graphs from their sets of subgraphs.
Journal of Combinatorial Theory, Series B,
Vol. 21,
Issue. 2,
p.
156.
Bondy, J. A.
and
Hemminger, R. L.
1977.
Graph reconstruction—a survey.
Journal of Graph Theory,
Vol. 1,
Issue. 3,
p.
227.
Manvel, Bennet
and
Weinstein, Joseph M.
1978.
Nearly acyclic graphs are reconstructible.
Journal of Graph Theory,
Vol. 2,
Issue. 1,
p.
25.
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.
Andreae, Thomas
and
Schmidt, Rüdiger
1984.
On the reconstruction of rayless infinite forests.
Journal of Graph Theory,
Vol. 8,
Issue. 3,
p.
405.
Hashiguchi, Kosaburo
1992.
LATIN '92.
Vol. 583,
Issue. ,
p.
246.
Welhan, Manuel
2010.
Reconstructing trees from two cards.
Journal of Graph Theory,
Vol. 63,
Issue. 3,
p.
243.
Bowler, Andrew
Brown, Paul
and
Fenner, Trevor
2010.
Families of pairs of graphs with a large number of common cards.
Journal of Graph Theory,
Vol. 63,
Issue. 2,
p.
146.