The SCEAS System
| |||||||

## Search the dblp DataBase
Talmage James Reid:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Fair Barbour Hurst, Talmage James Reid
**Ramsey Numbers For Cocircuits In Matroids.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1997, v:45, n:, pp:- [Journal] - Tristan Denley, Talmage James Reid
**On The Number Of Elements In Matroids With Small Circuits Or Cocircuits.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1999, v:8, n:6, pp:- [Journal] - Joseph E. Bonin, Talmage James Reid
**Simple Matroids With Bounded Cocircuit Size.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2000, v:9, n:5, pp:- [Journal] - Fair Barbour Hurst, Talmage James Reid
**Some Small Circuit- Cocircuit Ramsey Numbers for Matroids.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1995, v:4, n:, pp:67-80 [Journal] - Talmage James Reid, Haidong Wu
**On Minimally 3-Connected Binary Matroids.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2001, v:10, n:5, pp:- [Journal] - Talmage James Reid, Haidong Wu
**On elements in small cocircuits in minimally k-connected graphs and matroids.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:243, n:1-3, pp:273-282 [Journal] - Talmage James Reid, Jakayla R. Robbins
**A note on clone sets in representable matroids.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:17, pp:2128-2130 [Journal] - Talmage James Reid
**Ramsey Numbers for Matroids.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1997, v:18, n:5, pp:589-595 [Journal] - Talmage James Reid, Haidong Wu
**A Longest Cycle Version of Tutte's Wheels Theorem.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1997, v:70, n:1, pp:202-215 [Journal] - Talmage James Reid, Lee Inmon Virden
**On rounded five-element lines of matroids.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:163, n:1-3, pp:119-127 [Journal] - Talmage James Reid
**Triangles in 3-connected matroids.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:90, n:3, pp:281-296 [Journal] - Talmage James Reid
**A note on roundedness in 4-connected matroids.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:91, n:2, pp:211-214 [Journal] - Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton
**Degree sequence and independence in K(4)-free graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:141, n:1-3, pp:285-290 [Journal] - Paul Erdös, Talmage James Reid, Richard H. Schelp, William Staton
**Sizes of graphs with induced subgraphs of large maximum degree.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:158, n:1-3, pp:283-286 [Journal] **On deletions of largest bonds in graphs.**[Citation Graph (, )][DBLP]**On clone sets of GF(q)-representable matroids.**[Citation Graph (, )][DBLP]**On minor-minimally 3-connected binary matroids.**[Citation Graph (, )][DBLP]**Clonal sets in GF(q)-representable matroids.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |