Talmage James Reid

According to our database1, Talmage James Reid authored at least 29 papers between 1990 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Clones in matroids representable over a prime field.
Discrete Mathematics, 2018

2013
Bicircular Matroid Designs.
Ars Comb., 2013

2011
On the circuit-spectrum of binary matroids.
Eur. J. Comb., 2011

Obstructions to a binary matroid being graphic.
Eur. J. Comb., 2011

2010
Characterizing 3-connected planar graphs and graphic matroids.
Journal of Graph Theory, 2010

Clonal sets in GF(q)-representable matroids.
Discrete Mathematics, 2010

2009
On clone sets of GF(q)-representable matroids.
Discrete Mathematics, 2009

On minor-minimally 3-connected binary matroids.
Discrete Mathematics, 2009

2008
On minimally k-connected matroids.
J. Comb. Theory, Ser. B, 2008

On deletions of largest bonds in graphs.
Discrete Mathematics, 2008

2006
A note on clone sets in representable matroids.
Discrete Mathematics, 2006

2002
On elements in small cocircuits in minimally k-connected graphs and matroids.
Discrete Mathematics, 2002

2001
On Minimally 3-Connected Binary Matroids.
Combinatorics, Probability & Computing, 2001

2000
On Non-Essential Edges in 3-Connected Graphs.
Graphs and Combinatorics, 2000

On the 3-Connected Matroids That are Minimal Having a Fixed Restriction.
Graphs and Combinatorics, 2000

Simple Matroids With Bounded Cocircuit Size.
Combinatorics, Probability & Computing, 2000

1999
On The Number Of Elements In Matroids With Small Circuits Or Cocircuits.
Combinatorics, Probability & Computing, 1999

A non-planar version of Tutte's wheels theorem.
Australasian J. Combinatorics, 1999

1997
A Longest Cycle Version of Tutte's Wheels Theorem.
J. Comb. Theory, Ser. B, 1997

Ramsey Numbers for Matroids.
Eur. J. Comb., 1997

On rounded five-element lines of matroids.
Discrete Mathematics, 1997

Ramsey Numbers For Cocircuits In Matroids.
Ars Comb., 1997

1996
On fixing edges in graph minors.
Graphs and Combinatorics, 1996

Sizes of graphs with induced subgraphs of large maximum degree.
Discrete Mathematics, 1996

1995
Degree sequence and independence in K(4)-free graphs.
Discrete Mathematics, 1995

Some Small Circuit- Cocircuit Ramsey Numbers for Matroids.
Combinatorics, Probability & Computing, 1995

1991
A note on roundedness in 4-connected matroids.
Discrete Mathematics, 1991

Triangles in 3-connected matroids.
Discrete Mathematics, 1991

1990
The Smallest Rounded Sets of Binary Matroids.
Eur. J. Comb., 1990


  Loading...