Reconstruction of maximal outerplanar graphs. - Bennet Manvel (Discret. Math., 1972)

Some basic observations on Kelly's conjecture for graphs. - Bennet Manvel (Discret. Math., 1974)

On reconstructing graphs from their sets of subgraphs. - Bennet Manvel (J. Comb. Theory B, 1976)

Nearly acyclic graphs are reconstructible. - Bennet Manvel; Joseph M. Weinstein (J. Graph Theory, 1978)

Separation of graphs into three components by the removal of edges. - Donald L. Goldsmith; Bennet Manvel; Vance Faber (J. Graph Theory, 1980)

Hamiltonian cycles in cubic 3-connected bipartite planar graphs. - Derek A. Holton; Bennet Manvel; Brendan D. McKay (J. Comb. Theory B, 1985)

Reconstruction of sequences. - Bennet Manvel; Aaron Meyerowitz; Allen J. Schwenk; K. Smith; Paul K. Stockmeyer (Discret. Math., 1991)

Graph Theory. - Lowell W. Beineke; Stephen B. Maurer; Edward R. Scheinerman; Bennet Manvel; Arthur T. White; Paul K. Stockmeyer; Michael Doob; Stefan A. Burr; András Gyárfás (Handbook of Discrete and Combinatorial Mathematics, 1999)