Raymond E. Pippert

According to our database, Raymond E. Pippert authored at least 11 papers between 1989 and 2003.

Collaborative distances:

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

2003

Multidimensional bipartite trees.

Lowell W. Beineke, Raymond E. Pippert

Discret. Math., 2003

A Symmetrical Beauty. A Non-simple 7-Venn Diagram With A Minimum Vertex Set.

Peter Hamburger, Raymond E. Pippert

Ars Comb., 2003

2002

The average connectivity of a graph.

Lowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert

Discret. Math., 2002

1996

Hypercube subgraphs with minimal detours.

Paul Erdös, Peter Hamburger, Raymond E. Pippert, William D. Weakley

J. Graph Theory, 1996

Hamilton Cycles in Planar Graphs and Venn Diagrams.

Kiran B. Chilakamarri, Peter Hamburger, Raymond E. Pippert

J. Comb. Theory B, 1996

on the Steiner Median of a Tree.

Lowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert

Discret. Appl. Math., 1996

1994

Edge-integrity: a survey.

Kunwarjit S. Bagga, Lowell W. Beineke, Marc J. Lipman, Raymond E. Pippert

Discret. Math., 1994

1993

On the honesty of graph complements.

Kunwarjit S. Bagga, Lowell W. Beineke, Marc J. Lipman, Raymond E. Pippert

Discret. Math., 1993

1992

On a leverage problem in the hypercube.

Peter Hamburger, Raymond E. Pippert, William Douglas Weakley

Networks, 1992

A Survey of Integrity.

Kunwarjit S. Bagga, Lowell W. Beineke, Wayne Goddard, Marc J. Lipman, Raymond E. Pippert

Discret. Appl. Math., 1992

1989

On the edge-connectivity vector of a graph.

Linda M. Lesniak, Raymond E. Pippert

Networks, 1989