default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTalmage James Reid
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j31]João Paulo Costalonga, Talmage James Reid, Haidong Wu:
Rooted Prism-Minors and Disjoint Cycles Containing a Specified Edge. Electron. J. Comb. 30(2) (2023)
2010 – 2019
- 2018
- [j30]Adam Gray, Talmage James Reid, Xiangqian Zhou
:
Clones in matroids representable over a prime field. Discret. Math. 341(1): 213-216 (2018) - 2013
- [j29]Torina Lewis, Jennifer McNulty, Nancy Ann Neudauer, Talmage James Reid, Laura Sheppardson:
Bicircular Matroid Designs. Ars Comb. 110: 513-523 (2013) - 2011
- [j28]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) - [j27]Manoel Lemos, Talmage James Reid, Haidong Wu:
On the circuit-spectrum of binary matroids. Eur. J. Comb. 32(6): 861-869 (2011) - 2010
- [j26]Talmage James Reid, Jakayla R. Robbins, Haidong Wu, Xiangqian Zhou:
Clonal sets in GF(q)-representable matroids. Discret. Math. 310(17-18): 2389-2397 (2010) - [j25]Manoel Lemos, Talmage James Reid, Haidong Wu:
Characterizing 3-connected planar graphs and graphic matroids. J. Graph Theory 64(2): 165-174 (2010)
2000 – 2009
- 2009
- [j24]Talmage James Reid, Xiangqian Zhou:
On clone sets of GF(q)-representable matroids. Discret. Math. 309(6): 1740-1745 (2009) - [j23]Loni Delaplane, Talmage James Reid, Haidong Wu, Xiangqian Zhou:
On minor-minimally 3-connected binary matroids. Discret. Math. 309(10): 3249-3254 (2009) - 2008
- [j22]Nolan McMurray, Talmage James Reid, Laura Sheppardson, Bing Wei, Haidong Wu:
On deletions of largest bonds in graphs. Discret. Math. 308(7): 1137-1141 (2008) - [j21]Talmage James Reid, Haidong Wu, Xiangqian Zhou:
On minimally k-connected matroids. J. Comb. Theory B 98(6): 1311-1324 (2008) - 2006
- [j20]Talmage James Reid, Jakayla R. Robbins:
A note on clone sets in representable matroids. Discret. Math. 306(17): 2128-2130 (2006) - 2005
- [j19]Nolan McMurray, Talmage James Reid, Bing Wei, Haidong Wu:
Largest circuits in matroids. Adv. Appl. Math. 34(1): 213-216 (2005) - 2002
- [j18]Talmage James Reid, Haidong Wu:
On elements in small cocircuits in minimally k-connected graphs and matroids. Discret. Math. 243(1-3): 273-282 (2002) - 2001
- [j17]Talmage James Reid, Haidong Wu:
On Minimally 3-Connected Binary Matroids. Comb. Probab. Comput. 10(5): 453-461 (2001) - 2000
- [j16]Joseph E. Bonin, Talmage James Reid:
Simple Matroids With Bounded Cocircuit Size. Comb. Probab. Comput. 9(5): 407-419 (2000) - [j15]Manoel Lemos, James G. Oxley, Talmage James Reid:
On the 3-Connected Matroids That are Minimal Having a Fixed Restriction. Graphs Comb. 16(3): 285-318 (2000) - [j14]Talmage James Reid, Haidong Wu:
On Non-Essential Edges in 3-Connected Graphs. Graphs Comb. 16(3): 337-354 (2000)
1990 – 1999
- 1999
- [j13]Talmage James Reid, Haidong Wu:
A non-planar version of Tutte's wheels theorem. Australas. J Comb. 20: 3-12 (1999) - [j12]Tristan Denley, Talmage James Reid:
On The Number Of Elements In Matroids With Small Circuits Or Cocircuits. Comb. Probab. Comput. 8(6): 529-537 (1999) - 1997
- [j11]Fair Barbour Hurst, Talmage James Reid:
Ramsey Numbers For Cocircuits In Matroids. Ars Comb. 45 (1997) - [j10]Talmage James Reid, Lee Inmon Virden:
On rounded five-element lines of matroids. Discret. Math. 163(1-3): 119-127 (1997) - [j9]Talmage James Reid:
Ramsey Numbers for Matroids. Eur. J. Comb. 18(5): 589-595 (1997) - [j8]Talmage James Reid, Haidong Wu:
A Longest Cycle Version of Tutte's Wheels Theorem. J. Comb. Theory B 70(1): 202-215 (1997) - 1996
- [j7]Paul Erdös, Talmage James Reid, Richard H. Schelp, William Staton:
Sizes of graphs with induced subgraphs of large maximum degree. Discret. Math. 158(1-3): 283-286 (1996) - [j6]Talmage James Reid:
On fixing edges in graph minors. Graphs Comb. 12(1): 59-68 (1996) - 1995
- [j5]Fair Barbour Hurst, Talmage James Reid:
Some Small Circuit- Cocircuit Ramsey Numbers for Matroids. Comb. Probab. Comput. 4: 67-80 (1995) - [j4]Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton:
Degree sequence and independence in K(4)-free graphs. Discret. Math. 141(1-3): 285-290 (1995) - 1991
- [j3]Talmage James Reid:
Triangles in 3-connected matroids. Discret. Math. 90(3): 281-296 (1991) - [j2]Talmage James Reid:
A note on roundedness in 4-connected matroids. Discret. Math. 91(2): 211-214 (1991) - 1990
- [j1]James G. Oxley, Talmage James Reid:
The Smallest Rounded Sets of Binary Matroids. Eur. J. Comb. 11(1): 47-56 (1990)
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 21:22 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:
