Stephen C. Locke

According to our database, Stephen C. Locke authored at least 36 papers between 1981 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2021

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

2018

A variant of Nim.

D. Gray, Stephen C. Locke

Discret. Math., 2018

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

2008

Snapshots for Velocities: 11223.

Christopher J. Hillar, Lionel Levine, Stephen C. Locke

Am. Math. Mon., 2008

2007

Dissecting a Polygon: 11170.

Emeric Deutsch, Stephen C. Locke

Am. Math. Mon., 2007

Perfect matchings after vertex deletions.

Robert E. L. Aldred, Richard P. Anstee, Stephen C. Locke

Discret. Math., 2007

2006

Coloring Graphs with Few Odd Cycles: 11086.

Stephen C. Locke, Richard Stong

Am. Math. Mon., 2006

2005

6-path-connectivity and 6-generation.

Marién Abreu, Domenico Labbate, Stephen C. Locke

Discret. Math., 2005

2004

The Game of Pathos: 10968.

Stephen C. Locke, Philip D. Straffin

Am. Math. Mon., 2004

Problem 11086.

Stephen C. Locke

Am. Math. Mon., 2004

2003

Spanning Cycles in Hypercubes: 10892.

Stephen C. Locke, Richard Stong

Am. Math. Mon., 2003

2002

Problem 10968.

Stephen C. Locke

Am. Math. Mon., 2002

2001

Highly Cohesive Graphs Have Long Nonseparating Paths: 10647.

Stephen C. Locke, Phil Tracy, H.-J. Voss

Am. Math. Mon., 2001

Problem 10892.

Stephen C. Locke

Am. Math. Mon., 2001

A Generalization of Hall's Theorem: 10701.

Fred Galvin, Stephen C. Locke, Sung Soo Kim, David Callan

Am. Math. Mon., 2001

2000

The cycle space of a 3-connected hamiltonian graph.

Mark V. Barovich, Stephen C. Locke

Discret. Math., 2000

1999

On non-Hamiltonian circulant digraphs of outdegree three.

Stephen C. Locke, Dave Witte

J. Graph Theory, 1999

1998

Further Notes on: Largest Triangle-free Subgraphs in Powers of Cycles.

Stephen C. Locke

Ars Comb., 1998

1997

Lower bounds on size and independence in <i>K</i>₄-free graphs.

Kathryn Fraughnaugh, Stephen C. Locke

J. Graph Theory, 1997

Finding Independent Sets in<i>K</i>₄-Free 4-Regular Connected Graphs.

Stephen C. Locke, Feng Lou

J. Comb. Theory, Ser. B, 1997

1996

Finding Independent Sets in Triangle-free Graphs.

Kathryn Fraughnaugh, Stephen C. Locke

SIAM J. Discret. Math., 1996

1995

11/30 (Finding Large Independent Sets in Connected Triangle-Free 3-Regular Graphs).

Kathryn Fraughnaugh, Stephen C. Locke

J. Comb. Theory, Ser. B, 1995

1992

Triangle-free subgraphs of powers of cycles.

J. Adrian Bondy, Stephen C. Locke

Graphs Comb., 1992

1991

Cycles and paths through specified vertices in <i>k</i>-connected graphs.

Yoshimi Egawa, R. Glas, Stephen C. Locke

J. Comb. Theory, Ser. B, 1991

Cycles through three vertices in 2-connected graphs.

Stephen C. Locke, Cun-Quan Zhang

Graphs Comb., 1991

1990

A note on bipartite subgraphs of triangle-free regular graphs.

Stephen C. Locke

J. Graph Theory, 1990

The hamilton spaces of cayley graphs on abelian groups.

Brian Alspach, Stephen C. Locke, Dave Witte

Discret. Math., 1990

1989

Flows in circulant graphs of odd order are sums of Hamilton cycles.

Stephen C. Locke, Dave Witte

Discret. Math., 1989

The subchromatic number of a graph.

Michael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke

Discret. Math., 1989

1988

Extremal 3-connected graphs.

Stephen C. Locke

Discret. Math., 1988

1986

Bipartite density and the independence ratio.

Stephen C. Locke

J. Graph Theory, 1986

1985

A Basis for the Cycle Space of a 2-connected Graph.

Stephen C. Locke

Eur. J. Comb., 1985

A generalization of Dirac's theorem.

Stephen C. Locke

Comb., 1985

1982

Maximum <i>k</i>-colorable subgraphs.

Stephen C. Locke

J. Graph Theory, 1982

Relative lengths of paths and cycles in <i>k</i>-connected graphs.

Stephen C. Locke

J. Comb. Theory, Ser. B, 1982

1981

Relative lengths of paths and cycles in 3-connected graphs.

J. Adrian Bondy, Stephen C. Locke

Discret. Math., 1981