Lowell W. Beineke

According to our database1, Lowell W. Beineke authored at least 35 papers between 1973 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Reviews.
Am. Math. Mon., 2019

2016
A number theoretic problem on super line graphs.
AKCE Int. J. Graphs Comb., 2016

2005
Detour-saturated graphs.
J. Graph Theory, 2005

2003
Multidimensional bipartite trees.
Discret. Math., 2003

Introduction to Graphs.
Proceedings of the Handbook of Graph Theory., 2003

2002
No Cycling in the Graphs!
Electron. Notes Discret. Math., 2002

The average connectivity of a graph.
Discret. Math., 2002

The decycling number of graphs.
Australas. J Comb., 2002

2001
On the Maximum Number of Cyclic Triples in Oriented Graphs.
J. Comb. Theory, Ser. B, 2001

Strongly multiplicative graphs.
Discuss. Math. Graph Theory, 2001

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

Queens graphs.
Discret. Math., 1999

The super line graph L<sub>2</sub>.
Discret. Math., 1999

Independence and cycles in super line graphs.
Australas. J Comb., 1999

1997
Decycling graphs.
J. Graph Theory, 1997

Opinion functions on trees.
Discret. Math., 1997

Graphs with Maximum Edge-Integrity.
Ars Comb., 1997

1996
Pearls in Graph Theory: A Comprehensive Introduction (Nora Hartsfield and Gerhard Ringel).
SIAM Rev., 1996

Random packing by rho-connected rho-regular graphs.
Discret. Math., 1996

on the Steiner Median of a Tree.
Discret. Appl. Math., 1996

1994
Random packings of graphs.
Discret. Math., 1994

Edge-integrity: a survey.
Discret. Math., 1994

1993
On the honesty of graph complements.
Discret. Math., 1993

1992
A Survey of Integrity.
Discret. Appl. Math., 1992

1986
Desert island theorems.
J. Graph Theory, 1986

1982
Cycles in bipartite tournaments.
J. Comb. Theory, Ser. B, 1982

Connection digraphs and second-order line digraphs.
Discret. Math., 1982

1980
On the crossing numbers of products of cycles and graphs of order four.
J. Graph Theory, 1980

The cochromatic index of a graph.
Discret. Math., 1980

1979
On Line Graphs with Crossing Number 1.
J. Graph Theory, 1979

1978
The crossing number of C<sub>3</sub> × C<sub>n</sub>.
J. Comb. Theory, Ser. B, 1978

1977
Blocks and the nonorientable genus of graphs.
J. Graph Theory, 1977

1976
Infinite digraphs isomorphic with their line digraphs.
J. Comb. Theory, Ser. B, 1976

On small graphs critical with respect to edge colourings.
Discret. Math., 1976

1973
On the edge-chromatic number of a graph.
Discret. Math., 1973


  Loading...