The SCEAS System
| |||||||

## Search the dblp DataBase
Lowell W. Beineke:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Lowell W. Beineke, Wayne Goddard, Marc J. Lipman
**Graphs with Maximum Edge-Integrity.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1997, v:46, n:, pp:- [Journal] - Kunwarjit S. Bagga, Lowell W. Beineke, Wayne Goddard, Marc J. Lipman, Raymond E. Pippert
**A Survey of Integrity.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1992, v:37, n:, pp:13-28 [Journal] - Lowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert
**on the Steiner Median of a Tree.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:68, n:3, pp:249-258 [Journal] - Lowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert
**The average connectivity of a graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:252, n:1-3, pp:31-45 [Journal] - Lowell W. Beineke, Raymond E. Pippert
**Multidimensional bipartite trees.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:1, pp:17-26 [Journal] - Lowell W. Beineke, Frank Harary
**On the Maximum Number of Cyclic Triples in Oriented Graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2001, v:81, n:2, pp:165-176 [Journal] - Lowell W. Beineke, Charles H. C. Little
**Cycles in bipartite tournaments.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1982, v:32, n:2, pp:140-145 [Journal] - Richard D. Ringeisen, Lowell W. Beineke
**The crossing number of C**[Citation Graph (0, 0)][DBLP]_{3}× C_{n}. J. Comb. Theory, Ser. B, 1978, v:24, n:2, pp:134-136 [Journal] - Lowell W. Beineke, Robert L. Hemminger
**Infinite digraphs isomorphic with their line digraphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1976, v:21, n:3, pp:245-256 [Journal] - Lowell W. Beineke, Jean E. Dunbar, Marietjie Frick
**Detour-saturated graphs.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2005, v:49, n:2, pp:116-134 [Journal] - Lowell W. Beineke, Richard D. Ringeisen, Joseph Straight
**The cochromatic index of a graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1980, v:31, n:2, pp:153-159 [Journal] - Lowell W. Beineke, Christina Zamfirescu
**Connection digraphs and second-order line digraphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:39, n:3, pp:237-254 [Journal] - Lowell W. Beineke, Izak Broere, Michael A. Henning
**Queens graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:206, n:1-3, pp:63-75 [Journal] - Jay S. Bagga, Lowell W. Beineke, Badri N. Varma
**The super line graph L**[Citation Graph (0, 0)][DBLP]_{2}. Discrete Mathematics, 1999, v:206, n:1-3, pp:51-61 [Journal] - Lowell W. Beineke, Michael A. Henning
**Opinion functions on trees.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:167, n:, pp:127-139 [Journal] - Lowell W. Beineke, Peter Hamburger, William D. Weakley
**Random packing by rho-connected rho-regular graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:160, n:1-3, pp:41-47 [Journal] - Kunwarjit S. Bagga, Lowell W. Beineke, Marc J. Lipman, Raymond E. Pippert
**On the honesty of graph complements.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1993, v:122, n:1-3, pp:1-6 [Journal] - Kunwarjit S. Bagga, Lowell W. Beineke, Marc J. Lipman, Raymond E. Pippert
**Edge-integrity: a survey.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:124, n:1-3, pp:3-12 [Journal] - Lowell W. Beineke, Peter Hamburger, Wayne Goddard
**Random packings of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:125, n:1-3, pp:45-54 [Journal]
Search in 0.019secs, Finished in 0.019secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |