| 2011 | ||
|---|---|---|
| j25 | Hong-Jian Lai, Manoel Lemos, Talmage James Reid, Yehong Shao, Haidong Wu: Obstructions to a binary matroid being graphic. Eur. J. Comb. 32(6): 853-860 (2011) | |
| j24 | Manoel Lemos, Talmage James Reid, Haidong Wu: On the circuit-spectrum of binary matroids. Eur. J. Comb. 32(6): 861-869 (2011) | |
| 2010 | ||
| j23 | Talmage James Reid, Jakayla R. Robbins, Haidong Wu, Xiangqian Zhou: Clonal sets in GF(q)-representable matroids. Discrete Mathematics 310(17-18): 2389-2397 (2010) | |
| j22 | Manoel Lemos, Talmage James Reid, Haidong Wu: Characterizing 3-connected planar graphs and graphic matroids. Journal of Graph Theory 64(2): 165-174 (2010) | |
| 2009 | ||
| j21 | Talmage James Reid, Xiangqian Zhou: On clone sets of GF(q)-representable matroids. Discrete Mathematics 309(6): 1740-1745 (2009) | |
| j20 | Loni Delaplane, Talmage James Reid, Haidong Wu, Xiangqian Zhou: On minor-minimally 3-connected binary matroids. Discrete Mathematics 309(10): 3249-3254 (2009) | |
| 2008 | ||
| j19 | Nolan McMurray, Talmage James Reid, Laura Sheppardson, Bing Wei, Haidong Wu: On deletions of largest bonds in graphs. Discrete Mathematics 308(7): 1137-1141 (2008) | |
| j18 | Talmage James Reid, Haidong Wu, Xiangqian Zhou: On minimally k-connected matroids. J. Comb. Theory, Ser. B 98(6): 1311-1324 (2008) | |
| 2006 | ||
| j17 | Talmage James Reid, Jakayla R. Robbins: A note on clone sets in representable matroids. Discrete Mathematics 306(17): 2128-2130 (2006) | |
| 2002 | ||
| j16 | Talmage James Reid, Haidong Wu: On elements in small cocircuits in minimally k-connected graphs and matroids. Discrete Mathematics 243(1-3): 273-282 (2002) | |
| 2001 | ||
| j15 | Talmage James Reid, Haidong Wu: On Minimally 3-Connected Binary Matroids. Combinatorics, Probability & Computing 10(5): 453-461 (2001) | |
| 2000 | ||
| j14 | Joseph E. Bonin, Talmage James Reid: Simple Matroids With Bounded Cocircuit Size. Combinatorics, Probability & Computing 9(5): 407-419 (2000) | |
| j13 | Manoel Lemos, James G. Oxley, Talmage James Reid: On the 3-Connected Matroids That are Minimal Having a Fixed Restriction. Graphs and Combinatorics 16(3): 285-318 (2000) | |
| j12 | Talmage James Reid, Haidong Wu: On Non-Essential Edges in 3-Connected Graphs. Graphs and Combinatorics 16(3): 337-354 (2000) | |
| 1999 | ||
| j11 | Tristan Denley, Talmage James Reid: On The Number Of Elements In Matroids With Small Circuits Or Cocircuits. Combinatorics, Probability & Computing 8(6): 529-537 (1999) | |
| 1997 | ||
| j10 | Fair Barbour Hurst, Talmage James Reid: Ramsey Numbers For Cocircuits In Matroids. Ars Comb. 45 (1997) | |
| j9 | Talmage James Reid, Lee Inmon Virden: On rounded five-element lines of matroids. Discrete Mathematics 163(1-3): 119-127 (1997) | |
| j8 | ||
| j7 | Talmage James Reid, Haidong Wu: A Longest Cycle Version of Tutte's Wheels Theorem. J. Comb. Theory, Ser. B 70(1): 202-215 (1997) | |
| 1996 | ||
| j6 | Paul Erdös, Talmage James Reid, Richard H. Schelp, William Staton: Sizes of graphs with induced subgraphs of large maximum degree. Discrete Mathematics 158(1-3): 283-286 (1996) | |
| j5 | ||
| 1995 | ||
| j4 | Fair Barbour Hurst, Talmage James Reid: Some Small Circuit- Cocircuit Ramsey Numbers for Matroids. Combinatorics, Probability & Computing 4: 67-80 (1995) | |
| j3 | Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton: Degree sequence and independence in K(4)-free graphs. Discrete Mathematics 141(1-3): 285-290 (1995) | |
| 1991 | ||
| j2 | ||
| j1 | Talmage James Reid: A note on roundedness in 4-connected matroids. Discrete Mathematics 91(2): 211-214 (1991) | |
Data released under the ODC-BY 1.0 license — See also our legal information page