2008 |
7 | | L. H. Clark,
J. P. McSorley:
Comment on "The Expectation Of Independent Domination Number Over Random Binary Trees".
Ars Comb. 87: (2008) |
1996 |
6 | EE | Curtis A. Barefoot,
L. H. Clark,
Roger C. Entringer,
T. D. Porter,
László A. Székely,
Zsolt Tuza:
Cycle-saturated graphs of minimum size.
Discrete Mathematics 150(1-3): 31-48 (1996) |
1994 |
5 | EE | Curtis A. Barefoot,
L. H. Clark,
A. J. Depew,
Roger C. Entringer,
László A. Székely:
Subdivision thresholds for two classes of graphs.
Discrete Mathematics 125(1-3): 15-30 (1994) |
1992 |
4 | EE | László A. Székely,
L. H. Clark,
Roger C. Entringer:
An inequality for degree sequences.
Discrete Mathematics 103(3): 293-300 (1992) |
3 | | L. H. Clark,
Farhad Shahrokhi,
László A. Székely:
A Linear Time Algorithm for Graph Partition Problems.
Inf. Process. Lett. 42(1): 19-24 (1992) |
1991 |
2 | EE | L. H. Clark,
Roger C. Entringer,
László A. Székely:
Threshold functions for local properties of graphs: triangles.
Discrete Applied Mathematics 34(1-3): 83-105 (1991) |
1990 |
1 | EE | L. H. Clark,
Roger C. Entringer:
The number of cutvertices in graphs with given minimum degree.
Discrete Mathematics 81(2): 137-145 (1990) |