default search action
Stephen C. Locke
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j36]Stephen J. Curran, Richard M. Low, Stephen C. Locke:
C_4-face-magic toroidal labelings on C_m × C_n. Art Discret. Appl. Math. 4(1) (2021)
2010 – 2019
- 2018
- [j35]W. H. Chan, Richard M. Low, Stephen C. Locke
, Irene O. L. Wong
A map of the P-positions in 'Nim With a Pass' played on heap sizes of at most four. Discret. Appl. Math. 244: 44-55 (2018) - [j34]D. Gray, Stephen C. Locke
A variant of Nim. Discret. Math. 341(9): 2485-2489 (2018)
2000 – 2009
- 2008
- [j33]Christopher J. Hillar, Lionel Levine, Stephen C. Locke:
Snapshots for Velocities: 11223. Am. Math. Mon. 115(1): 75-76 (2008) - 2007
- [j32]Robert E. L. Aldred, Richard P. Anstee, Stephen C. Locke
Perfect matchings after vertex deletions. Discret. Math. 307(23): 3048-3054 (2007) - [j31]Emeric Deutsch, Stephen C. Locke:
Dissecting a Polygon: 11170. Am. Math. Mon. 114(5): 456-457 (2007) - 2006
- [j30]Stephen C. Locke, Richard Stong:
Coloring Graphs with Few Odd Cycles: 11086. Am. Math. Mon. 113(4): 372 (2006) - 2005
- [j29]Marién Abreu
6-path-connectivity and 6-generation. Discret. Math. 301(1): 20-27 (2005) - 2004
- [j28]Stephen C. Locke:
Problem 11086. Am. Math. Mon. 111(5): 440-441 (2004) - [j27]Stephen C. Locke, Philip D. Straffin:
The Game of Pathos: 10968. Am. Math. Mon. 111(5): 443-444 (2004) - 2003
- [j26]Stephen C. Locke, Richard Stong:
Spanning Cycles in Hypercubes: 10892. Am. Math. Mon. 110(5): 440-441 (2003) - 2002
- [j25]Stephen C. Locke:
Problem 10968. Am. Math. Mon. 109(8): 759-760 (2002) - 2001
- [j24]Fred Galvin, Stephen C. Locke, Sung Soo Kim, David Callan:
A Generalization of Hall's Theorem: 10701. Am. Math. Mon. 108(1): 79-80 (2001) - [j23]Stephen C. Locke, Phil Tracy, H.-J. Voss:
Highly Cohesive Graphs Have Long Nonseparating Paths: 10647. Am. Math. Mon. 108(5): 470-472 (2001) - [j22]Stephen C. Locke:
Problem 10892. Am. Math. Mon. 108(7): 668 (2001) - 2000
- [j21]Mark V. Barovich, Stephen C. Locke
The cycle space of a 3-connected hamiltonian graph. Discret. Math. 220(1-3): 13-33 (2000)
1990 – 1999
- 1999
- [j20]Stephen C. Locke, Dave Witte:
On non-Hamiltonian circulant digraphs of outdegree three. J. Graph Theory 30(4): 319-331 (1999) - 1998
- [j19]Stephen C. Locke:
Further Notes on: Largest Triangle-free Subgraphs in Powers of Cycles. Ars Comb. 49 (1998) - 1997
- [j18]Stephen C. Locke
Finding Independent Sets inK4-Free 4-Regular Connected Graphs. J. Comb. Theory B 71(1): 85-110 (1997) - [j17]Kathryn Fraughnaugh, Stephen C. Locke:
Lower bounds on size and independence in K4-free graphs. J. Graph Theory 26(2): 61-71 (1997) - 1996
- [j16]Kathryn Fraughnaugh, Stephen C. Locke
Finding Independent Sets in Triangle-free Graphs. SIAM J. Discret. Math. 9(4): 674-681 (1996) - 1995
- [j15]Kathryn Fraughnaugh, Stephen C. Locke
11/30 (Finding Large Independent Sets in Connected Triangle-Free 3-Regular Graphs). J. Comb. Theory B 65(1): 51-72 (1995) - 1992
- [j14]J. Adrian Bondy, Stephen C. Locke
Triangle-free subgraphs of powers of cycles. Graphs Comb. 8(2): 109-118 (1992) - 1991
- [j13]Stephen C. Locke
Cycles through three vertices in 2-connected graphs. Graphs Comb. 7(3): 265-269 (1991) - [j12]Yoshimi Egawa, R. Glas, Stephen C. Locke
Cycles and paths through specified vertices in k-connected graphs. J. Comb. Theory B 52(1): 20-29 (1991) - 1990
- [j11]Brian Alspach, Stephen C. Locke
The hamilton spaces of cayley graphs on abelian groups. Discret. Math. 82(2): 113-126 (1990) - [j10]Stephen C. Locke
A note on bipartite subgraphs of triangle-free regular graphs. J. Graph Theory 14(2): 181-185 (1990)
1980 – 1989
- 1989
- [j9]Michael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke
The subchromatic number of a graph. Discret. Math. 74(1-2): 33-49 (1989) - [j8]Stephen C. Locke
Flows in circulant graphs of odd order are sums of Hamilton cycles. Discret. Math. 78(1-2): 105-114 (1989) - 1988
- [j7]Stephen C. Locke
Extremal 3-connected graphs. Discret. Math. 68(2-3): 257-263 (1988) - 1986
- [j6]Stephen C. Locke
Bipartite density and the independence ratio. J. Graph Theory 10(1): 47-53 (1986) - 1985
- [j5]Stephen C. Locke
A generalization of Dirac's theorem. Comb. 5(2): 149-159 (1985) - [j4]Stephen C. Locke
A Basis for the Cycle Space of a 2-connected Graph. Eur. J. Comb. 6(3): 253-256 (1985) - 1982
- [j3]Stephen C. Locke
Relative lengths of paths and cycles in k-connected graphs. J. Comb. Theory B 32(2): 206-222 (1982) - [j2]Stephen C. Locke
Maximum k-colorable subgraphs. J. Graph Theory 6(2): 123-132 (1982) - 1981
- [j1]J. Adrian Bondy, Stephen C. Locke
Relative lengths of paths and cycles in 3-connected graphs. Discret. Math. 33(2): 111-122 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: