Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLowell W. Beineke
Person information
- affiliation: Indiana University-Purdue University Fort Wayne, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j37]Jay S. Bagga, Lowell W. Beineke:
New results and open problems in line graphs. AKCE Int. J. Graphs Comb. 19(3): 182-190 (2022)- 2021
- [j36]Mohammad Reza Oboudi
, Ali Zeydi Abdian, Ali Reza Ashrafi, Lowell W. Beineke:
Laplacian spectral determination of path-friendship graphs. AKCE Int. J. Graphs Comb. 18(1): 33-38 (2021) - [j35]Ali Zeydi Abdian, Lowell W. Beineke, Krishnaiyan Thulasiraman, Reza Tayebi Khorami, Mohammad Reza Oboudi:
The spectral determination of the connected multicone graphs. AKCE Int. J. Graphs Comb. 18(1): 47-52 (2021) - 2020
- [j34]Ali Zeydi Abdian, Lowell W. Beineke, Mohammad Reza Oboudi, Afshin Behmaram, Krishnaiyan Thulasiraman, Saeid Alikhani, Kewen Zhao:
On the spectral determinations of the connected multicone graphs. AKCE Int. J. Graphs Comb. 17(1): 149-158 (2020) - 2019
- [j33]Lowell W. Beineke:
Reviews. Am. Math. Mon. 126(4): 379-384 (2019) - 2016
- [j32]Jay S. Bagga, Lowell W. Beineke, Badri N. Varma:
A number theoretic problem on super line graphs. AKCE Int. J. Graphs Comb. 13(2): 177-190 (2016) - 2005
- [j31]Lowell W. Beineke, Jean E. Dunbar, Marietjie Frick:
Detour-saturated graphs. J. Graph Theory 49(2): 116-134 (2005) - 2003
- [j30]Lowell W. Beineke, Raymond E. Pippert:
Multidimensional bipartite trees. Discret. Math. 272(1): 17-26 (2003) - 2002
- [j29]Sheng Bau, Lowell W. Beineke:
The decycling number of graphs. Australas. J Comb. 25: 285-298 (2002) - [j28]Lowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert:
The average connectivity of a graph. Discret. Math. 252(1-3): 31-45 (2002) - [j27]Lowell W. Beineke, Robert C. Vandell:
No Cycling in the Graphs! Electron. Notes Discret. Math. 11: 81-88 (2002) - 2001
- [j26]Lowell W. Beineke, Suresh Manjanath Hegde:
Strongly multiplicative graphs. Discuss. Math. Graph Theory 21(1): 63-75 (2001) - [j25]Lowell W. Beineke, Frank Harary:
On the Maximum Number of Cyclic Triples in Oriented Graphs. J. Comb. Theory B 81(2): 165-176 (2001) - 1999
- [j24]Jay S. Bagga, Lowell W. Beineke, Badri N. Varma:
Independence and cycles in super line graphs. Australas. J Comb. 19: 171-178 (1999) - [j23]Jay S. Bagga, Lowell W. Beineke, Badri N. Varma:
The super line graph L2. Discret. Math. 206(1-3): 51-61 (1999) - [j22]Lowell W. Beineke, Izak Broere, Michael A. Henning:
Queens graphs. Discret. Math. 206(1-3): 63-75 (1999) - 1997
- [j21]Lowell W. Beineke, Wayne Goddard, Marc J. Lipman:
Graphs with Maximum Edge-Integrity. Ars Comb. 46 (1997) - [j20]Lowell W. Beineke, Michael A. Henning:
Opinion functions on trees. Discret. Math. 167-168: 127-139 (1997) - [j19]Lowell W. Beineke, Robert C. Vandell:
Decycling graphs. J. Graph Theory 25(1): 59-77 (1997) - 1996
- [j18]Lowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert:
on the Steiner Median of a Tree. Discret. Appl. Math. 68(3): 249-258 (1996) - [j17]Lowell W. Beineke, Peter Hamburger, William D. Weakley:
Random packing by rho-connected rho-regular graphs. Discret. Math. 160(1-3): 41-47 (1996) - [j16]Lowell W. Beineke:
Pearls in Graph Theory: A Comprehensive Introduction (Nora Hartsfield and Gerhard Ringel). SIAM Rev. 38(1): 159 (1996) - 1994
- [j15]Kunwarjit S. Bagga, Lowell W. Beineke, Marc J. Lipman, Raymond E. Pippert:
Edge-integrity: a survey. Discret. Math. 124(1-3): 3-12 (1994) - [j14]Lowell W. Beineke, Peter Hamburger, Wayne Goddard:
Random packings of graphs. Discret. Math. 125(1-3): 45-54 (1994) - 1993
- [j13]Kunwarjit S. Bagga, Lowell W. Beineke, Marc J. Lipman, Raymond E. Pippert:
On the honesty of graph complements. Discret. Math. 122(1-3): 1-6 (1993) - 1992
- [j12]Kunwarjit S. Bagga, Lowell W. Beineke, Wayne Goddard, Marc J. Lipman, Raymond E. Pippert:
A Survey of Integrity. Discret. Appl. Math. 37/38: 13-28 (1992) - 1986
- [j11]Lowell W. Beineke:
Desert island theorems. J. Graph Theory 10(3): 325-329 (1986) - 1982
- [j10]Lowell W. Beineke, Christina Zamfirescu:
Connection digraphs and second-order line digraphs. Discret. Math. 39(3): 237-254 (1982) - [j9]Lowell W. Beineke, Charles H. C. Little:
Cycles in bipartite tournaments. J. Comb. Theory B 32(2): 140-145 (1982) - 1980
- [j8]Lowell W. Beineke, Richard D. Ringeisen, Joseph Straight:
The cochromatic index of a graph. Discret. Math. 31(2): 153-159 (1980) - [j7]Lowell W. Beineke, Richard D. Ringeisen:
On the crossing numbers of products of cycles and graphs of order four. J. Graph Theory 4(2): 145-155 (1980) - 1979
- [j6]V. R. Kulli, D. G. Akka, Lowell W. Beineke:
On Line Graphs with Crossing Number 1. J. Graph Theory 3(1): 87-90 (1979) - 1978
- [j5]Richard D. Ringeisen, Lowell W. Beineke:
The crossing number of C3 × Cn. J. Comb. Theory B 24(2): 134-136 (1978) - 1977
- [j4]Saul Stahl, Lowell W. Beineke:
Blocks and the nonorientable genus of graphs. J. Graph Theory 1(1): 75-78 (1977) - 1976
- [j3]Lowell W. Beineke, Stanley Fiorini:
On small graphs critical with respect to edge colourings. Discret. Math. 16(2): 109-121 (1976) - [j2]Lowell W. Beineke, Robert L. Hemminger:
Infinite digraphs isomorphic with their line digraphs. J. Comb. Theory B 21(3): 245-256 (1976) - 1973
- [j1]Lowell W. Beineke, Robin J. Wilson:
On the edge-chromatic number of a graph. Discret. Math. 5(1): 15-20 (1973)
Parts in Books or Collections
- 2003
- [p1]Jonathan L. Gross, Jay Yellen, Lowell W. Beineke, Robin J. Wilson:
Introduction to Graphs. Handbook of Graph Theory 2003: 1-55
Editorship
- 2017
- [e1]S. Arumugam, Jay S. Bagga, Lowell W. Beineke, B. S. Panda:
Theoretical Computer Science and Discrete Mathematics - First International Conference, ICTCSDM 2016, Krishnankoil, India, December 19-21, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10398, Springer 2017, ISBN 978-3-319-64418-9 [contents]
Reference Works
- 1999
- [r1]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:
Graph Theory. Handbook of Discrete and Combinatorial Mathematics 1999
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
