Relative lengths of paths and cycles in 3-connected graphs. - J. Adrian Bondy; Stephen C. Locke (Discret. Math., 1981)

Relative lengths of paths and cycles in k-connected graphs. - Stephen C. Locke (J. Comb. Theory B, 1982)

Maximum k-colorable subgraphs. - Stephen C. Locke (J. Graph Theory, 1982)

A generalization of Dirac's theorem. - Stephen C. Locke (Comb., 1985)

A Basis for the Cycle Space of a 2-connected Graph. - Stephen C. Locke (Eur. J. Comb., 1985)

Bipartite density and the independence ratio. - Stephen C. Locke (J. Graph Theory, 1986)

Extremal 3-connected graphs. - Stephen C. Locke (Discret. Math., 1988)

The subchromatic number of a graph. - Michael O. Albertson; Robert E. Jamison; Stephen T. Hedetniemi; Stephen C. Locke (Discret. Math., 1989)

Flows in circulant graphs of odd order are sums of Hamilton cycles. - Stephen C. Locke; Dave Witte (Discret. Math., 1989)

The hamilton spaces of cayley graphs on abelian groups. - Brian Alspach; Stephen C. Locke; Dave Witte (Discret. Math., 1990)

A note on bipartite subgraphs of triangle-free regular graphs. - Stephen C. Locke (J. Graph Theory, 1990)

Cycles through three vertices in 2-connected graphs. - Stephen C. Locke; Cun-Quan Zhang (Graphs Comb., 1991)

Cycles and paths through specified vertices in k-connected graphs. - Yoshimi Egawa; R. Glas; Stephen C. Locke (J. Comb. Theory B, 1991)

Triangle-free subgraphs of powers of cycles. - J. Adrian Bondy; Stephen C. Locke (Graphs Comb., 1992)

11/30 (Finding Large Independent Sets in Connected Triangle-Free 3-Regular Graphs). - Kathryn Fraughnaugh; Stephen C. Locke (J. Comb. Theory B, 1995)

Finding Independent Sets in Triangle-free Graphs. - Kathryn Fraughnaugh; Stephen C. Locke (SIAM J. Discret. Math., 1996)

Finding Independent Sets inK4-Free 4-Regular Connected Graphs. - Stephen C. Locke; Feng Lou (J. Comb. Theory B, 1997)

Lower bounds on size and independence in K4-free graphs. - Kathryn Fraughnaugh; Stephen C. Locke (J. Graph Theory, 1997)

Further Notes on: Largest Triangle-free Subgraphs in Powers of Cycles. - Stephen C. Locke (Ars Comb., 1998)

On non-Hamiltonian circulant digraphs of outdegree three. - Stephen C. Locke; Dave Witte (J. Graph Theory, 1999)

The cycle space of a 3-connected hamiltonian graph. - Mark V. Barovich; Stephen C. Locke (Discret. Math., 2000)

A Generalization of Hall's Theorem: 10701. - Fred Galvin; Stephen C. Locke; Sung Soo Kim; David Callan (Am. Math. Mon., 2001)

Problem 10892. - Stephen C. Locke (Am. Math. Mon., 2001)

Highly Cohesive Graphs Have Long Nonseparating Paths: 10647. - Stephen C. Locke; Phil Tracy; H.-J. Voss (Am. Math. Mon., 2001)

Problem 10968. - Stephen C. Locke (Am. Math. Mon., 2002)

Spanning Cycles in Hypercubes: 10892. - Stephen C. Locke; Richard Stong (Am. Math. Mon., 2003)

Problem 11086. - Stephen C. Locke (Am. Math. Mon., 2004)

The Game of Pathos: 10968. - Stephen C. Locke; Philip D. Straffin (Am. Math. Mon., 2004)

6-path-connectivity and 6-generation. - Marién Abreu; Domenico Labbate; Stephen C. Locke (Discret. Math., 2005)

Coloring Graphs with Few Odd Cycles: 11086. - Stephen C. Locke; Richard Stong (Am. Math. Mon., 2006)

Perfect matchings after vertex deletions. - Robert E. L. Aldred; Richard P. Anstee; Stephen C. Locke (Discret. Math., 2007)

Dissecting a Polygon: 11170. - Emeric Deutsch; Stephen C. Locke (Am. Math. Mon., 2007)

Snapshots for Velocities: 11223. - Christopher J. Hillar; Lionel Levine; Stephen C. Locke (Am. Math. Mon., 2008)

A map of the P-positions in 'Nim With a Pass' played on heap sizes of at most four. - W. H. Chan; Richard M. Low; Stephen C. Locke; Irene O. L. Wong (Discret. Appl. Math., 2018)

A variant of Nim. - D. Gray; Stephen C. Locke (Discret. Math., 2018)

C_4-face-magic toroidal labelings on C_m × C_n. - Stephen J. Curran; Richard M. Low; Stephen C. Locke (Art Discret. Appl. Math., 2021)