Stephen C. Locke - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2021

C_4-face-magic toroidal labelings on C_m × C_nStephen J. Curran, Richard M. Low, Stephen C. Locke. adam, 4(1), 2021. [doi]

2018

A map of the P-positions in 'Nim With a Pass' played on heap sizes of at most fourW. H. Chan, Richard M. Low, Stephen C. Locke, O. L. Wong. DAM, 244:44-55, 2018. [doi]

2008

Snapshots for Velocities: 11223Christopher J. Hillar, Lionel Levine, Stephen C. Locke. tamm, 115(1):75-76, 2008. [doi]

2007

Perfect matchings after vertex deletionsRobert E. L. Aldred, Richard P. Anstee, Stephen C. Locke. DM, 307(23):3048-3054, 2007. [doi]

Dissecting a Polygon: 11170Emeric Deutsch, Stephen C. Locke. tamm, 114(5):456-457, 2007. [doi]

2006

Coloring Graphs with Few Odd Cycles: 11086Stephen C. Locke, Richard Stong. tamm, 113(4):372, 2006. [doi]

2005

6-path-connectivity and 6-generationMarien Abreu, Domenico Labbate, Stephen C. Locke. DM, 301(1):20-27, 2005. [doi]

2004

The Game of Pathos: 10968Stephen C. Locke, Philip D. Straffin. tamm, 111(5):443-444, 2004. [doi]

Problem 11086Stephen C. Locke. tamm, 111(5):440-441, 2004. [doi]

2003

Spanning Cycles in Hypercubes: 10892Stephen C. Locke, Richard Stong. tamm, 110(5):440-441, 2003. [doi]

2002

Problem 10968Stephen C. Locke. tamm, 109(8):759-760, 2002. [doi]

2001

A Generalization of Hall's Theorem: 10701Fred Galvin, Stephen C. Locke, Sung-Soo Kim, David Callan. tamm, 108(1):79-80, 2001. [doi]

Highly Cohesive Graphs Have Long Nonseparating Paths: 10647Stephen C. Locke, Phil Tracy, H.-J. Voss. tamm, 108(5):470-472, 2001. [doi]

Problem 10892Stephen C. Locke. tamm, 108(7):668, 2001. [doi]

2000

The cycle space of a 3-connected hamiltonian graphMark V. Barovich, Stephen C. Locke. DM, 220(1-3):13-33, 2000. [doi]

1999

On non-Hamiltonian circulant digraphs of outdegree threeStephen C. Locke, Dave Witte. jgt, 30(4):319-331, 1999. [doi]

1998

Further Notes on: Largest Triangle-free Subgraphs in Powers of CyclesStephen C. Locke. arscom, 49, 1998.

1997

4-free graphsKathryn Fraughnaugh, Stephen C. Locke. jgt, 26(2):61-71, 1997. [doi]

Finding Independent Sets in::::K::::::4::-Free 4-Regular Connected GraphsStephen C. Locke, Feng Lou. JCT, 71(1):85-110, 1997. [doi]

1996

Finding Independent Sets in Triangle-free GraphsKathryn Fraughnaugh, Stephen C. Locke. siamdm, 9(4):674-681, 1996. [doi]

1995

11/30 (Finding Large Independent Sets in Connected Triangle-Free 3-Regular Graphs)Kathryn Fraughnaugh, Stephen C. Locke. JCT, 65(1):51-72, 1995. [doi]

1992

Triangle-free subgraphs of powers of cyclesJ. A. Bondy, Stephen C. Locke. gc, 8(2):109-118, 1992. [doi]

1991

Cycles and paths through specified vertices in ::::k::::-connected graphsYoshimi Egawa, R. Glas, Stephen C. Locke. JCT, 52(1):20-29, 1991. [doi]

Cycles through three vertices in 2-connected graphsStephen C. Locke, Cun-Quan Zhang. gc, 7(3):265-269, 1991. [doi]

1990

The hamilton spaces of cayley graphs on abelian groupsBrian Alspach, Stephen C. Locke, Dave Witte. DM, 82(2):113-126, 1990. [doi]

1989

The subchromatic number of a graphMichael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke. DM, 74(1-2):33-49, 1989. [doi]

Flows in circulant graphs of odd order are sums of Hamilton cyclesStephen C. Locke, Dave Witte. DM, 78(1-2):105-114, 1989. [doi]

1988

Extremal 3-connected graphsStephen C. Locke. DM, 68(2-3):257-263, 1988. [doi]

1986

Bipartite density and the independence ratioStephen C. Locke. jgt, 10(1):47-53, 1986. [doi]

1985

A generalization of Dirac s theoremStephen C. Locke. combinatorica, 5(2):149-159, 1985.

A Basis for the Cycle Space of a 2-connected GraphStephen C. Locke. ejc, 6(3):253-256, 1985. [doi]

1982

Relative lengths of paths and cycles in ::::k::::-connected graphsStephen C. Locke. JCT, 32(2):206-222, 1982. [doi]

1981

Relative lengths of paths and cycles in 3-connected graphsJ. A. Bondy, Stephen C. Locke. DM, 33(2):111-122, 1981. [doi]

Sign in or sign up to see more results.

runs on WebDSL