The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
James G. Oxley: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. James G. Oxley, Geoff Whittle
    Tuttle invariants for 2-polymatroids. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:9-20 [Conf]
  2. James G. Oxley
    On the intersections of circuits and cocircuits in matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:187-195 [Journal]
  3. James G. Oxley
    Proof of a conjecture of Kahn for non-binary matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:4, pp:343-345 [Journal]
  4. James G. Oxley
    A Matroid Generalization of a Result of Dirac. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:2, pp:267-273 [Journal]
  5. James G. Oxley, Don Row
    On fixing elements in matroid minors. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:1, pp:69-74 [Journal]
  6. James G. Oxley, Geoff Whittle
    Some exluded-minor theorems for a class of polymatroids. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:4, pp:467-476 [Journal]
  7. Safwan Akkari, James G. Oxley
    Some LOcal Extremal Connectivity Results for Matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:367-384 [Journal]
  8. James G. Oxley, Dominic J. A. Welsh
    Chromatic, Flow And Reliability Polynomials: The Complexity Of Their Coefficients. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:4, pp:- [Journal]
  9. James G. Oxley, Don Row
    Panelling Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:109-122 [Journal]
  10. Manoel Lemos, James G. Oxley
    On size, circumference and circuit removal in 3-connected matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:220, n:1-3, pp:145-157 [Journal]
  11. Manoel Lemos, James G. Oxley
    On the 3-connected matroids that are minimal having a fixed spanning restriction. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:131-165 [Journal]
  12. Manoel Lemos, James G. Oxley
    On the minor-minimal 2-connected graphs having a fixed minor. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:77-118 [Journal]
  13. James G. Oxley
    The structure of a 3-connected matroid with a 3-separating set of essential elements. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:265, n:1-3, pp:173-187 [Journal]
  14. James G. Oxley, Charles Semple, Dirk L. Vertigan, Geoffrey P. Whittle
    Infinite antichains of matroids with characteristic set {p}. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:242, n:1-3, pp:175-185 [Journal]
  15. James G. Oxley, Geoffrey P. Whittle
    On the non-uniqueness of q-cones of matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:271-275 [Journal]
  16. Brahim Chaourar, James G. Oxley
    On series-parallel extensions of uniform matroids. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:7, pp:877-879 [Journal]
  17. Manoel Lemos, James G. Oxley
    On the minor-minimal 3-connected matroids having a fixed minor. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:8, pp:1097-1123 [Journal]
  18. James G. Oxley, Haidong Wu
    On the Structure of 3-connected Matroids and Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:5, pp:667-688 [Journal]
  19. James G. Oxley, Geoffrey P. Whittle
    On Weak Maps of Ternary Matroids. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:3, pp:377-389 [Journal]
  20. Rhiannon Hall, James G. Oxley, Charles Semple
    The structure of 3-connected matroids of path width three. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:3, pp:964-989 [Journal]
  21. James G. Oxley, Charles Semple, Geoff Whittle
    The structure of the 3-separations of 3-connected matroids II. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:4, pp:1239-1261 [Journal]
  22. James G. Oxley, Haidong Wu
    The 3-Connected Graphs with Exactly Three Non-Essential Edges. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:2, pp:233-246 [Journal]
  23. Safwan Akkari, James G. Oxley
    Some extremal connectivity results for matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:2, pp:301-320 [Journal]
  24. Ying Cheng, James G. Oxley
    On weakly symmetric graphs of order twice a prime. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:42, n:2, pp:196-211 [Journal]
  25. Collette R. Coullard, James G. Oxley
    Extensions of Tutte's wheels-and-whirls theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:56, n:1, pp:130-140 [Journal]
  26. Guoli Ding, Bogdan Oporowski, James G. Oxley
    On Infinite Antichains of Matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:63, n:1, pp:21-40 [Journal]
  27. Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk Vertigan
    Unavoidable Minors of Large 3-Connected Binary Matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:2, pp:334-360 [Journal]
  28. Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk L. Vertigan
    Unavoidable Minors of Large 3-Connected Matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:71, n:2, pp:244-293 [Journal]
  29. James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle
    On the Excluded Minors for Quaternary Matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:80, n:1, pp:57-68 [Journal]
  30. James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle
    Totally Free Expansions of Matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:84, n:1, pp:130-179 [Journal]
  31. James F. Geelen, James G. Oxley, Dirk Vertigan, Geoff Whittle
    A short proof of non-GF(5)-representability of matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:105-121 [Journal]
  32. Rhiannon Hall, James G. Oxley, Charles Semple, Geoffrey P. Whittle
    On Matroids of Branch-Width Three. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:1, pp:148-171 [Journal]
  33. Manoel Lemos, James G. Oxley
    Matroid packing and covering with circuits through an element. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:1, pp:135-158 [Journal]
  34. Bogdan Oporowski, James G. Oxley, Robin Thomas
    Typical Subgraphs of 3- and 4-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:57, n:2, pp:239-257 [Journal]
  35. James G. Oxley
    On singleton 1-rounded sets of matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:2, pp:189-197 [Journal]
  36. James G. Oxley
    On the matroids representable over GF(4). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:41, n:2, pp:250-252 [Journal]
  37. James G. Oxley
    A characterization of the ternary matroids with no M(K4)-minor. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:42, n:2, pp:212-249 [Journal]
  38. James G. Oxley
    The regular matroids with no 5-wheel minor. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:46, n:3, pp:292-305 [Journal]
  39. James G. Oxley
    A characterization of a class of non-binary matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:49, n:2, pp:181-189 [Journal]
  40. James G. Oxley, Charles Semple, Dirk L. Vertigan
    Generalized Delta?-Y Exchange and k-Regular Matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:79, n:1, pp:1-65 [Journal]
  41. James G. Oxley, Charles Semple, Geoff Whittle
    The structure of the 3-separations of 3-connected matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:92, n:2, pp:257-293 [Journal]
  42. James G. Oxley, Dirk L. Vertigan, Geoffrey P. Whittle
    On Inequivalent Representations of Matroids over Finite Fields. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:67, n:2, pp:325-343 [Journal]
  43. James G. Oxley, Geoffrey P. Whittle
    A Characterization of Tutte Invariants of 2-Polymatroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:59, n:2, pp:210-244 [Journal]
  44. James G. Oxley
    On Hartfiel and Maxson's definition of connected sets of a matroid. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:249-250 [Journal]
  45. James G. Oxley
    On a packing problem for infinite graphs and independence spaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:26, n:2, pp:123-130 [Journal]
  46. James G. Oxley
    On some extremal connectivity results for graphs and matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:2, pp:181-198 [Journal]
  47. James G. Oxley
    On a matroid identity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:1, pp:55-60 [Journal]
  48. James G. Oxley
    On minor-minimally-connected matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:51, n:1, pp:63-72 [Journal]
  49. James G. Oxley
    On ternary transversal matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:1, pp:71-83 [Journal]
  50. James G. Oxley
    A note on Negami's polynomial invariants for graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:76, n:3, pp:279-281 [Journal]
  51. Allan D. Mills, James G. Oxley
    A class of non-binary matroids with many binary minors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:207, n:1-3, pp:173-187 [Journal]
  52. Manoel Lemos, James G. Oxley
    On packing minors into connected matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:189, n:1-3, pp:283-289 [Journal]
  53. James G. Oxley
    On packing 3-connected restrictions into 3-connected matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:178, n:1-3, pp:181-198 [Journal]
  54. James G. Oxley
    On an excluded-minor class of matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:1, pp:35-52 [Journal]
  55. James G. Oxley
    Ternary paving matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:1, pp:77-86 [Journal]
  56. James Oxley, Geoff Whittle
    Connectivity of submodular functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:105, n:1-3, pp:173-184 [Journal]
  57. James G. Oxley, Dominic J. A. Welsh
    Tutte polynomials computable in polynomial time. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:109, n:1-3, pp:185-192 [Journal]
  58. James G. Oxley, Haidong Wu
    On matroid connectivity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:146, n:1-3, pp:321-324 [Journal]
  59. S. R. Kingan, James G. Oxley
    On the matroids in which all hyperplanes are binary. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:160, n:1-3, pp:265-271 [Journal]

Search in 0.021secs, Finished in 0.024secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002