Name
Affiliation
Papers
JAMES OXLEY
Department of Mathematics, Louisiana State University, Baton Rouge, LA, USA
35
Collaborators
Citations 
PageRank 
19
194
24.39
Referers 
Referees 
References 
107
98
246
Search Limit
100107
Title
Citations
PageRank
Year
The Unbreakable Frame Matroids00.342020
Towards a splitter theorem for internally 4-connected binary matroids IV50.592014
Constructing internally 4-connected binary matroids00.342013
Constructing a 3-tree for a 3-connected matroid10.372013
An upgraded Wheels-and-Whirls Theorem for 3-connected matroids60.662012
Towards a splitter theorem for internally 4-connected binary matroids70.682012
A chain theorem for internally 4-connected binary matroids80.672011
Exposing 3-separations in 3-connected matroids30.422011
On bipartite restrictions of binary matroids00.342011
When excluding one matroid prevents infinite antichains30.422010
A chain theorem for matroids50.542008
Wild triangles in 3-connected matroids70.612008
Maintaining 3-connectivity relative to a fixed basis30.512008
The structure of 3-connected matroids of path width three90.812007
Matroid packing and covering with circuits through an element10.352006
On pancyclic representable matroids10.432005
The structure of equivalent 3-separations in a 3-connected matroid81.012005
Fork-decompositions of matroids40.492004
A short proof of non-GF(5)-representability of matroids30.432004
On the minor-minimal 2-connected graphs having a fixed minor00.342004
The structure of the 3-separations of 3-connected matroids272.482004
On series-parallel extensions of uniform matroids00.342003
The structure of a 3-connected matroid with a 3-separating set of essential elements20.672003
On removable cycles through every edge20.492003
On the minor-minimal 3-connected matroids having a fixed minor20.502003
On matroids of branch-width three61.452002
Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients110.852002
Totally free expansions of matroids151.382002
Generalized D-Y -exchange and k-regular matroids161.512000
On size, circumference and circuit removal in 3-connected matroids80.682000
On the 3-connected matriods that are minimal having a fixed spanning restriction40.652000
Generalized Δ–Y Exchange and k-Regular Matroids00.342000
On the 3-Connected Matroids That are Minimal Having a Fixed Restriction30.512000
Unavoidable minors of large 3-connected matroids161.431997
The Smallest Rounded Sets of Binary Matroids80.761990