Locke, Stephen
http://www.math.fau.edu/locke/
lockes@fau.edu
- M. Areu, D. Labbate, and S.C. Locke. 6-path-connectivity and 6-generation. Submitted, October 10, 2002: Special issue of Discrete Math. (combinatorics 2002 conference). Abstract .
- F. Hadlock, F. Hoffman, and S.C. Locke. Manhattan graphs . Congressus Numerantium 171 (2004), 25-32. Synopsis .
- S.C. Locke and Y. Kaneko. The minimum degree approach for Paul Seymour's distance 2 conjecture: case d=7 . In preparation for submission to: Congressus Numerantium .
- M. Abreu and S.C. Locke. Non-separating n-vertex trees in (2n+2)-cohesive graphs of diameter at most 4 . Congressus Numerantium 154 (2002), 21-30. Abstract .
- S.C. Locke and C. Teng . Odd sums of long cycles in 2-connected graphs . Congressus Numerantium 159 (2002), 19-30. Abstract .
- S.C. Locke and H.-J. Voss . A distance-degree condition and non-separating paths: Solution to Problem 10647 [ MAA Monthly 105 (1998), proposed by S.C.L.]. Incorporated into solution presented in MAA Monthly 108 (2001), 470-472.
- S.C. Locke and Y. Kaneko. The minimum degree approach for Paul Seymour's distance 2 conjecture. Congressus Numerantium 148 (2001), 201-206. [MR# 200k:05078]
- M. Barovich and S.C. Locke, The cycle space of a 3-connected hamiltonian graph . Discrete Mathematics 220 (2000), 13-33. Abstract . [MR# 2001d:05099]
- S.C. Locke and D. Witte . On non-hamiltonian circulant digraphs of outdegree three . Journal of Graph Theory 30 (1999), 319-331. Abstract . [MR# 99m:05069]
Dave Witte, dwitte@math.okstate.edu , has stored preprints: L A T E X 2e file (requires Journal of Graph Theory macros); or PostScript file . - S.C. Locke . Further notes on: largest triangle-free subgraphs in powers of cycles. Ars Combinatoria 49 (1998), 65-77. Abstract . dvi . [MR# 99c:05106]
- S.C. Locke and Feng Lou. Finding independent sets in K 4 -free 4-regular connected graphs. Journal of Combinatorial Theory, Series B 71 (1997), pages 85-110. Abstract . [MR# 98h:05104]
- K. Fraughnaugh and S.C. Locke. Lower bounds on size and independence in K 4 -free graphs. Journal of Graph Theory 26 (1997), pages 61-71. Abstract . [MR# 98h:05099]
- K. Fraughnaugh and S.C. Locke. Finding independent sets in triangle-free graphs. S.I.A.M. Journal of Discrete Mathematics 9 (1996), 674-681. Abstract . [MR# 96f:05180]
- K. Fraughnaugh and S.C. Locke. 11/30 (finding large independent sets in connected triangle-free 3-regular graphs. Journal of Combinatorial Theory, Series B 65 (1995), 51-72. K. Fraughnaugh: KFraughn@carbon.cudenver.edu . Abstract . [MR# 96f:05099]
