The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stephen C. Locke: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stephen C. Locke
    Further Notes on: Largest Triangle-free Subgraphs in Powers of Cycles. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:49, n:, pp:- [Journal]
  2. Stephen C. Locke
    A generalization of Dirac's theorem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:2, pp:149-159 [Journal]
  3. Marien Abreu, Domenico Labbate, Stephen C. Locke
    6-path-connectivity and 6-generation. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:301, n:1, pp:20-27 [Journal]
  4. Mark V. Barovich, Stephen C. Locke
    The cycle space of a 3-connected hamiltonian graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:220, n:1-3, pp:13-33 [Journal]
  5. Yoshimi Egawa, R. Glas, Stephen C. Locke
    Cycles and paths through specified vertices in k-connected graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:20-29 [Journal]
  6. Kathryn Fraughnaugh, Stephen C. Locke
    11/30 (Finding Large Independent Sets in Connected Triangle-Free 3-Regular Graphs). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:65, n:1, pp:51-72 [Journal]
  7. Stephen C. Locke
    Relative lengths of paths and cycles in k-connected graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1982, v:32, n:2, pp:206-222 [Journal]
  8. Stephen C. Locke, Feng Lou
    Finding Independent Sets inK4-Free 4-Regular Connected Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:71, n:1, pp:85-110 [Journal]
  9. Kathryn Fraughnaugh, Stephen C. Locke
    Finding Independent Sets in Triangle-free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:4, pp:674-681 [Journal]
  10. J. A. Bondy, Stephen C. Locke
    Relative lengths of paths and cycles in 3-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:33, n:2, pp:111-122 [Journal]
  11. Stephen C. Locke
    Extremal 3-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:2-3, pp:257-263 [Journal]
  12. Michael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke
    The subchromatic number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:33-49 [Journal]
  13. Stephen C. Locke, Dave Witte
    Flows in circulant graphs of odd order are sums of Hamilton cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:78, n:1-2, pp:105-114 [Journal]
  14. Brian Alspach, Stephen C. Locke, Dave Witte
    The hamilton spaces of cayley graphs on abelian groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:2, pp:113-126 [Journal]

  15. Perfect matchings after vertex deletions. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.017secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002