Talmage James Reid

From MaRDI portal


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Rooted prism-minors and disjoint cycles containing a specified edge
The Electronic Journal of Combinatorics
2023-06-15Paper
Clones in matroids representable over a prime field
Discrete Mathematics
2017-10-24Paper
On regular matroids without certain minors
Annals of Combinatorics
2015-05-05Paper
Internally 4-connected binary matroids without a prism+\(e\) minor
Annals of Combinatorics
2015-05-05Paper
scientific article; zbMATH DE number 6346420 (Why is no real title available?)
 
2014-09-19Paper
Obstructions to a binary matroid being graphic
European Journal of Combinatorics
2011-08-09Paper
On the circuit-spectrum of binary matroids
European Journal of Combinatorics
2011-08-09Paper
Maximum size circuit Pairs in matroids
 
2011-07-13Paper
Geometry, perspective drawing, and mechanisms
 
2011-06-27Paper
Characterizing 3-connected planar graphs and graphic matroids
Journal of Graph Theory
2010-11-10Paper
Clonal sets in \(GF(q)\)-representable matroids
Discrete Mathematics
2010-10-11Paper
On minor-minimally 3-connected binary matroids
Discrete Mathematics
2009-06-23Paper
On clone sets of \(GF(q)\)-representable matroids
Discrete Mathematics
2009-06-17Paper
On minimally \(k\)-connected matroids
Journal of Combinatorial Theory. Series B
2008-12-08Paper
On deletions of largest bonds in graphs
Discrete Mathematics
2008-02-11Paper
Pairs of largest circuits in 3-connected matroids
Linear Algebra and its Applications
2007-11-09Paper
A note on clone sets in representable matroids
Discrete Mathematics
2006-09-14Paper
Largest circuits in matroids
Advances in Applied Mathematics
2005-05-04Paper
On minimally 3-connected binary matroids
Combinatorics, Probability and Computing
2002-08-14Paper
On elements in small cocircuits in minimally \(k\)-connected graphs and matroids
Discrete Mathematics
2002-06-19Paper
The Matroid Ramsey Number n(6,6)
Combinatorics, Probability and Computing
2002-02-21Paper
Simple matroids with bounded cocircuit size
Combinatorics, Probability and Computing
2001-11-28Paper
On non-essential edges in 3-connected graphs
Graphs and Combinatorics
2001-06-21Paper
On the 3-connected matroids that are minimal having a fixed restriction
Graphs and Combinatorics
2000-11-14Paper
On the Number of Elements in Matroids with Small Circuits or Cocircuits
Combinatorics, Probability and Computing
2000-06-04Paper
Ramsey numbers for matroids
European Journal of Combinatorics
2000-04-09Paper
scientific article; zbMATH DE number 1409187 (Why is no real title available?)
 
2000-03-01Paper
scientific article; zbMATH DE number 1355271 (Why is no real title available?)
 
1999-12-02Paper
A longest cycle version of Tutte's wheels theorem
Journal of Combinatorial Theory. Series B
1998-02-22Paper
On rounded five-element lines of matroids
Discrete Mathematics
1997-08-05Paper
Sizes of graphs with induced subgraphs of large maximum degree
Discrete Mathematics
1997-03-23Paper
On fixing edges in graph minors
Graphs and Combinatorics
1996-04-21Paper
Degree sequence and independence in \(K(4)\)-free graphs
Discrete Mathematics
1996-03-05Paper
scientific article; zbMATH DE number 786171 (Why is no real title available?)
 
1995-12-18Paper
Some Small Circuit-Cocircuit Ramsey Numbers for Matroids
Combinatorics, Probability and Computing
1995-09-27Paper
scientific article; zbMATH DE number 554158 (Why is no real title available?)
 
1994-08-10Paper
A note on roundedness in 4-connected matroids
Discrete Mathematics
1992-06-28Paper
Triangles in 3-connected matroids
Discrete Mathematics
1992-06-26Paper
The smallest rounded sets of binary matroids
European Journal of Combinatorics
1992-06-25Paper
scientific article; zbMATH DE number 4145916 (Why is no real title available?)
 
1990-01-01Paper
scientific article; zbMATH DE number 4095478 (Why is no real title available?)
 
1988-01-01Paper
Graph Configurations and Independent Bondage Numbers of Planar Graphs
 
N/APaper


Research outcomes over time


This page was built for person: Talmage James Reid