Bennet Manvel

According to our database, Bennet Manvel authored at least 8 papers between 1972 and 1999.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

1999

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

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

1991

Reconstruction of sequences.

Bennet Manvel, Aaron Meyerowitz, Allen J. Schwenk, K. Smith, Paul K. Stockmeyer

Discret. Math., 1991

1985

Hamiltonian cycles in cubic 3-connected bipartite planar graphs.

Derek A. Holton, Bennet Manvel, Brendan D. McKay

J. Comb. Theory, Ser. B, 1985

1980

Separation of graphs into three components by the removal of edges.

Donald L. Goldsmith, Bennet Manvel, Vance Faber

J. Graph Theory, 1980

1978

Nearly acyclic graphs are reconstructible.

Bennet Manvel, Joseph M. Weinstein

J. Graph Theory, 1978

1976

On reconstructing graphs from their sets of subgraphs.

Bennet Manvel

J. Comb. Theory, Ser. B, 1976

1974

Some basic observations on Kelly's conjecture for graphs.

Bennet Manvel

Discret. Math., 1974

1972

Reconstruction of maximal outerplanar graphs.

Bennet Manvel

Discret. Math., 1972