Stephen C. Locke

36 papers Journal 36
YearRankTypeTitle / Venue / Authors
2021 J jnl
C_4-face-magic toroidal labelings on C_m × C_n.
Art Discret. Appl. Math.
Stephen J. Curran, Richard M. Low, Stephen C. Locke
2018 J jnl
A map of the P-positions in 'Nim With a Pass' played on heap sizes of at most four.
Discret. Appl. Math.
W. H. Chan, Richard M. Low, Stephen C. Locke, Irene O. L. Wong
2018 J jnl
A variant of Nim.
Discret. Math.
D. Gray, Stephen C. Locke
2008 J jnl
Snapshots for Velocities: 11223.
Am. Math. Mon.
Christopher J. Hillar, Lionel Levine, Stephen C. Locke
2007 J jnl
Dissecting a Polygon: 11170.
Am. Math. Mon.
Emeric Deutsch, Stephen C. Locke
2007 J jnl
Perfect matchings after vertex deletions.
Discret. Math.
Robert E. L. Aldred, Richard P. Anstee, Stephen C. Locke
2006 J jnl
Coloring Graphs with Few Odd Cycles: 11086.
Am. Math. Mon.
Stephen C. Locke, Richard Stong
2005 J jnl
6-path-connectivity and 6-generation.
Discret. Math.
Marién Abreu, Domenico Labbate, Stephen C. Locke
2004 J jnl
Problem 11086.
Am. Math. Mon.
Stephen C. Locke
2004 J jnl
The Game of Pathos: 10968.
Am. Math. Mon.
Stephen C. Locke, Philip D. Straffin
2003 J jnl
Spanning Cycles in Hypercubes: 10892.
Am. Math. Mon.
Stephen C. Locke, Richard Stong
2002 J jnl
Problem 10968.
Am. Math. Mon.
Stephen C. Locke
2001 J jnl
A Generalization of Hall's Theorem: 10701.
Am. Math. Mon.
Fred Galvin, Stephen C. Locke, Sung Soo Kim, David Callan
2001 J jnl
Highly Cohesive Graphs Have Long Nonseparating Paths: 10647.
Am. Math. Mon.
Stephen C. Locke, Phil Tracy, H.-J. Voss
2001 J jnl
Problem 10892.
Am. Math. Mon.
Stephen C. Locke
2000 J jnl
The cycle space of a 3-connected hamiltonian graph.
Discret. Math.
Mark V. Barovich, Stephen C. Locke
1999 J jnl
On non-Hamiltonian circulant digraphs of outdegree three.
J. Graph Theory
Stephen C. Locke, Dave Witte
1998 J jnl
Further Notes on: Largest Triangle-free Subgraphs in Powers of Cycles.
Ars Comb.
Stephen C. Locke
1997 J jnl
Finding Independent Sets in
J. Comb. Theory B
Stephen C. Locke, Feng Lou
1997 J jnl
Lower bounds on size and independence in
J. Graph Theory
Kathryn Fraughnaugh, Stephen C. Locke
1996 J jnl
Finding Independent Sets in Triangle-free Graphs.
SIAM J. Discret. Math.
Kathryn Fraughnaugh, Stephen C. Locke
1995 J jnl
11/30 (Finding Large Independent Sets in Connected Triangle-Free 3-Regular Graphs).
J. Comb. Theory B
Kathryn Fraughnaugh, Stephen C. Locke
1992 J jnl
Triangle-free subgraphs of powers of cycles.
Graphs Comb.
J. Adrian Bondy, Stephen C. Locke
1991 J jnl
Cycles and paths through specified vertices in
J. Comb. Theory B
Yoshimi Egawa, R. Glas, Stephen C. Locke
1991 J jnl
Cycles through three vertices in 2-connected graphs.
Graphs Comb.
Stephen C. Locke, Cun-Quan Zhang
1990 J jnl
A note on bipartite subgraphs of triangle-free regular graphs.
J. Graph Theory
Stephen C. Locke
1990 J jnl
The hamilton spaces of cayley graphs on abelian groups.
Discret. Math.
Brian Alspach, Stephen C. Locke, Dave Witte
1989 J jnl
Flows in circulant graphs of odd order are sums of Hamilton cycles.
Discret. Math.
Stephen C. Locke, Dave Witte
1989 J jnl
The subchromatic number of a graph.
Discret. Math.
Michael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke
1988 J jnl
Extremal 3-connected graphs.
Discret. Math.
Stephen C. Locke
1986 J jnl
Bipartite density and the independence ratio.
J. Graph Theory
Stephen C. Locke
1985 J jnl
A Basis for the Cycle Space of a 2-connected Graph.
Eur. J. Comb.
Stephen C. Locke
1985 J jnl
A generalization of Dirac's theorem.
Comb.
Stephen C. Locke
1982 J jnl
Maximum
J. Graph Theory
Stephen C. Locke
1982 J jnl
Relative lengths of paths and cycles in
J. Comb. Theory B
Stephen C. Locke
1981 J jnl
Relative lengths of paths and cycles in 3-connected graphs.
Discret. Math.
J. Adrian Bondy, Stephen C. Locke