Clones in matroids representable over a prime field. | 0 | 0.34 | 2018 |
Bicircular Matroid Designs. | 0 | 0.34 | 2013 |
On the circuit-spectrum of binary matroids | 0 | 0.34 | 2011 |
Obstructions to a binary matroid being graphic | 2 | 0.40 | 2011 |
Characterizing 3-connected planar graphs and graphic matroids | 2 | 0.43 | 2010 |
On deletions of largest bonds in graphs | 2 | 0.44 | 2008 |
Largest circuits in matroids | 3 | 0.63 | 2005 |
On elements in small cocircuits in minimally k-connected graphs and matroids | 3 | 0.49 | 2002 |
On Minimally 3-Connected Binary Matroids | 3 | 0.45 | 2001 |
On Non-Essential Edges in 3-Connected Graphs | 0 | 0.34 | 2000 |
On the 3-Connected Matroids That are Minimal Having a Fixed Restriction | 3 | 0.51 | 2000 |
Simple Matroids with Bounded Cocircuit Size | 0 | 0.34 | 2000 |
A non-planar version of Tutte's wheels theorem. | 0 | 0.34 | 1999 |
On the Number of Elements in Matroids with Small Circuits or Cocircuits | 0 | 0.34 | 1999 |
Ramsey Numbers For Cocircuits In Matroids | 2 | 0.41 | 1997 |
Ramsey numbers for matroids | 6 | 1.16 | 1997 |
On rounded five-element lines of matroids | 0 | 0.34 | 1997 |
A longest cycle version of Tutte's wheels theorem | 3 | 0.78 | 1997 |
Sizes of graphs with induced subgraphs of large maximum degree | 3 | 0.70 | 1996 |
On fixing edges in graph minors | 0 | 0.34 | 1996 |
Degree sequence and independence in K(4)-free graphs | 1 | 0.62 | 1995 |
Some Small Circuit- Cocircuit Ramsey Numbers for Matroids | 3 | 0.48 | 1995 |
Triangles in 3-connected matroids | 4 | 0.55 | 1991 |
A note on roundedness in 4-connected matroids | 0 | 0.34 | 1991 |
The Smallest Rounded Sets of Binary Matroids | 8 | 0.76 | 1990 |