The SCEAS System
Navigation Menu

Search the dblp DataBase


L. H. Clark: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. L. H. Clark, Farhad Shahrokhi, László A. Székely
    A Linear Time Algorithm for Graph Partition Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:19-24 [Journal]
  2. L. H. Clark, Roger C. Entringer
    The number of cutvertices in graphs with given minimum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:81, n:2, pp:137-145 [Journal]
  3. László A. Székely, L. H. Clark, Roger C. Entringer
    An inequality for degree sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:3, pp:293-300 [Journal]
  4. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:31-48 [Journal]
  5. Curtis A. Barefoot, L. H. Clark, A. J. Depew, Roger C. Entringer, László A. Székely
    Subdivision thresholds for two classes of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:15-30 [Journal]

  6. Comment on "The Expectation Of Independent Domination Number Over Random Binary Trees". [Citation Graph (, )][DBLP]

  7. Threshold functions for local properties of graphs: triangles. [Citation Graph (, )][DBLP]

Search in 0.001secs, Finished in 0.001secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002