Stephen C. Locke

509 total citations
32 papers, 314 citations indexed

About

Stephen C. Locke is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Stephen C. Locke has authored 32 papers receiving a total of 314 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 20 papers in Discrete Mathematics and Combinatorics and 16 papers in Electrical and Electronic Engineering. Recurrent topics in Stephen C. Locke's work include Advanced Graph Theory Research (23 papers), Limits and Structures in Graph Theory (17 papers) and graph theory and CDMA systems (15 papers). Stephen C. Locke is often cited by papers focused on Advanced Graph Theory Research (23 papers), Limits and Structures in Graph Theory (17 papers) and graph theory and CDMA systems (15 papers). Stephen C. Locke collaborates with scholars based in United States, Canada and Italy. Stephen C. Locke's co-authors include J. A. Bondy, Kathryn Fraughnaugh, Dave Witte, Michael O. Albertson, Stephen T. Hedetniemi, Robert E. Jamison, Brian Alspach, Yoshimi Egawa, Richard Stong and R.P. Anstee and has published in prestigious journals such as American Mathematical Monthly, Discrete Mathematics and Journal of Combinatorial Theory Series B.

In The Last Decade

Stephen C. Locke

29 papers receiving 286 citations

Peers

Stephen C. Locke

CTM

DMC

GT

EEE

CNC

Ko‐Wei Lih Taiwan

Zevi Miller United States

Hian Poh Yap Singapore

Heinz‐Jürgen Voss Germany

Michael Stiebitz Germany

André Kündgen United States

Yoshimi Egawa Japan

Tomáš Kaiser Czechia

Matthias Kriesell Germany

János Barát Hungary

Ko‐Wei Lih Taiwan

Stephen C. Locke

206 ×0.8

CTM

110 ×0.6

DMC

63 ×0.7

GT

50 ×0.5

EEE

30 ×0.5

CNC

Citations per year, relative to Stephen C. Locke Stephen C. Locke (= 1×) peers Ko‐Wei Lih

Countries citing papers authored by Stephen C. Locke

Since Specialization

Citations

This map shows the geographic impact of Stephen C. Locke's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Stephen C. Locke with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stephen C. Locke more than expected).

Fields of papers citing papers by Stephen C. Locke

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Stephen C. Locke. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Stephen C. Locke. The network helps show where Stephen C. Locke may publish in the future.

Co-authorship network of co-authors of Stephen C. Locke

This figure shows the co-authorship network connecting the top 25 collaborators of Stephen C. Locke. A scholar is included among the top collaborators of Stephen C. Locke based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Stephen C. Locke. Stephen C. Locke is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Aldred, R. E. L., R.P. Anstee, & Stephen C. Locke. (2007). Perfect matchings after vertex deletions. Discrete Mathematics. 307(23). 3048–3054. 9 indexed citations

2.

Locke, Stephen C., et al.. (2005). 6-path-connectivity and 6-generation. Discrete Mathematics. 301(1). 20–27. 1 indexed citations

3.

Locke, Stephen C. & Richard Stong. (2003). Spanning Cycles in Hypercubes: 10892. American Mathematical Monthly. 110(5). 440–440. 8 indexed citations

4.

Locke, Stephen C.. (2001). 10892. American Mathematical Monthly. 108(7). 668–668. 7 indexed citations

5.

Locke, Stephen C., et al.. (2001). Highly Cohesive Graphs Have Long Nonseparating Paths: 10647. American Mathematical Monthly. 108(5). 470–470. 1 indexed citations

6.

Locke, Stephen C., et al.. (2000). The cycle space of a 3-connected hamiltonian graph. Discrete Mathematics. 220(1-3). 13–33. 2 indexed citations

7.

Locke, Stephen C. & Dave Witte. (1999). On non-Hamiltonian circulant digraphs of outdegree three. Journal of Graph Theory. 30(4). 319–331. 10 indexed citations

8.

Locke, Stephen C.. (1998). Further Notes on: Largest Triangle-free Subgraphs in Powers of Cycles.. Ars Combinatoria. 49. 4 indexed citations

9.

Fraughnaugh, Kathryn & Stephen C. Locke. (1997). Lower bounds on size and independence in K 4 -free graphs. Journal of Graph Theory. 26(2). 61–71. 5 indexed citations

10.

Locke, Stephen C., et al.. (1997). Finding Independent Sets inK4-Free 4-Regular Connected Graphs. Journal of Combinatorial Theory Series B. 71(1). 85–110. 8 indexed citations

11.

Fraughnaugh, Kathryn & Stephen C. Locke. (1996). Finding Independent Sets in Triangle-Free Graphs. SIAM Journal on Discrete Mathematics. 9(4). 674–681. 6 indexed citations

12.

Fraughnaugh, Kathryn & Stephen C. Locke. (1995). 11/30 (Finding Large Independent Sets in Connected Triangle-Free 3-Regular Graphs). Journal of Combinatorial Theory Series B. 65(1). 51–72. 16 indexed citations

13.

Bondy, J. A. & Stephen C. Locke. (1992). Triangle-free subgraphs of powers of cycles. Graphs and Combinatorics. 8(2). 109–118. 4 indexed citations

14.

Egawa, Yoshimi, et al.. (1991). Cycles and paths through specified vertices in k-connected graphs. Journal of Combinatorial Theory Series B. 52(1). 20–29. 20 indexed citations

15.

Alspach, Brian, Stephen C. Locke, & Dave Witte. (1990). The hamilton spaces of cayley graphs on abelian groups. Discrete Mathematics. 82(2). 113–126. 20 indexed citations

16.

Albertson, Michael O., Robert E. Jamison, Stephen T. Hedetniemi, & Stephen C. Locke. (1989). The subchromatic number of a graph. Discrete Mathematics. 74(1-2). 33–49. 31 indexed citations

17.

Bondy, J. A. & Stephen C. Locke. (1986). Largest bipartite subgraphs in triangle‐free graphs with maximum degree three. Journal of Graph Theory. 10(4). 477–504. 55 indexed citations

18.

Locke, Stephen C.. (1985). A Basis for the Cycle Space of a 2-connected Graph. European Journal of Combinatorics. 6(3). 253–256. 4 indexed citations

19.

Locke, Stephen C.. (1982). Maximum k‐colorable subgraphs. Journal of Graph Theory. 6(2). 123–132. 28 indexed citations

20.

Bondy, J. A. & Stephen C. Locke. (1981). Relative lengths of paths and cycles in 3-connected graphs. Discrete Mathematics. 33(2). 111–122. 21 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact