☰

Talmage J. Reid - Publications

Affiliations: 
The University of Mississippi, USA 
Area:
Mathematics
Tree Info Similar researchers PubMed Report error

24 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2015 Harville K, Reid TJ, Wu H. On Regular Matroids Without Certain Minors Annals of Combinatorics. 19: 153-170. DOI: 10.1007/S00026-015-0257-X  0.665
2015 Harville K, Reid TJ, Wu H. Internally 4-Connected Binary Matroids Without a Prism+e Minor Annals of Combinatorics. 19: 131-152. DOI: 10.1007/S00026-015-0252-2  0.641
2010 Reid TJ, Robbins J, Wu H, Zhou X. Clonal sets in GF(q)-representable matroids Discrete Mathematics. 310: 2389-2397. DOI: 10.1016/J.Disc.2010.05.025  0.325
2010 Lemos M, Reid TJ, Wu H. Characterizing 3-connected planar graphs and graphic matroids Journal of Graph Theory. 64: 165-174. DOI: 10.1002/Jgt.V64:2  0.635
2009 Delaplane L, Reid TJ, Wu H, Zhou X. On minor-minimally 3-connected binary matroids Discrete Mathematics. 309: 3249-3254. DOI: 10.1016/J.Disc.2008.09.027  0.445
2009 Reid TJ, Zhou X. On clone sets of GF (q)-representable matroids Discrete Mathematics. 309: 1740-1745. DOI: 10.1016/J.Disc.2008.02.032  0.371
2008 Reid TJ, Wu H, Zhou X. On minimally k-connected matroids Journal of Combinatorial Theory. Series B. 98: 1311-1324. DOI: 10.1016/J.Jctb.2008.02.003  0.525
2007 Lemos M, Reid TJ, Williams B, Wu H. Pairs of largest circuits in 3-connected matroids Linear Algebra and Its Applications. 427: 313-316. DOI: 10.1016/J.Laa.2007.07.022  0.668
2006 Reid TJ, Robbins JR. A note on clone sets in representable matroids Discrete Mathematics. 306: 2128-2130. DOI: 10.1016/J.Disc.2006.05.005  0.305
2005 McMurray N, Reid TJ, Wei B, Wu H. Largest circuits in matroids Advances in Applied Mathematics. 34: 213-216. DOI: 10.1016/J.Aam.2004.09.002  0.651
2002 Reid TJ, Wu H. On elements in small cocircuits in minimally n-connected graphs and matroids Discrete Mathematics. 243: 273-282. DOI: 10.1016/S0012-365X(01)00220-5  0.67
2001 Reid TJ, Wu H. On Minimally 3-Connected Binary Matroids Combinatorics Probability and Computing. 10: 453-461. DOI: 10.1017/S0963548301004850  0.697
2000 Reid TJ, Wu H. On non-essential edges in 3-connected graphs Graphs and Combinatorics. 16: 337-354. DOI: 10.1007/S003730070015  0.565
2000 Lemos M, Oxley J, Reid TJ. On the 3-connected matroids that are minimal having a fixed restriction Graphs and Combinatorics. 16: 285-318. DOI: 10.1007/Pl00007223  0.414
1999 Bonin JE, McNulty J, Reid TJ. The Matroid Ramsey Number n(6,6) Combinatorics Probability and Computing. 8: 229-235. DOI: 10.1017/S0963548398003691  0.34
1999 Reid TJ, Wu H. A non-planar version of Tutte's Wheels Theorem Australasian Journal of Combinatorics. 20: 3-12.  0.539
1997 Reid TJ, Wu H. A longest cycle version of Tutte's Wheels Theorem Journal of Combinatorial Theory. Series B. 70: 202-215. DOI: 10.1006/Jctb.1997.1720  0.588
1997 Reid TJ. Ramsey numbers for matroids European Journal of Combinatorics. 18: 589-595. DOI: 10.1006/Eujc.1995.0112  0.566
1996 Erdos P, Reid TJ, Schelp R, Staton W. Sizes of graphs with induced subgraphs of large maximum degree Discrete Mathematics. 158: 283-286. DOI: 10.1016/0012-365X(95)00008-K  0.665
1996 Reid TJ. On fixing edges in graph minors Graphs and Combinatorics. 12: 59-68. DOI: 10.1007/Bf01858445  0.567
1995 Hurst FB, Reid TJ. Some Small Circuit-Cocircuit Ramsey Numbers for Matroids Combinatorics, Probability & Computing. 4: 67-80. DOI: 10.1017/S0963548300001486  0.504
1995 Erdos P, Faudree R, Reid TJ, Schelp R, Staton W. Degree sequence and independence in K(4)-free graphs Discrete Mathematics. 141: 285-290. DOI: 10.1016/0012-365X(93)E0226-T  0.523
1991 Reid TJ. Triangles in 3-connected matroids Discrete Mathematics. 90: 281-296. DOI: 10.1016/0012-365X(91)90149-V  0.304
1991 Reid TJ. A note on roundedness in 4-connected matroids Discrete Mathematics. 91: 211-214. DOI: 10.1016/0012-365X(91)90113-G  0.489
Show low-probability matches.