James G. Oxley

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Manoel Lemos

> Home > Persons > James G. Oxley

Publications

2023
[j141]
- view
  authority control:
- export record
  dblp key:
  - journals/combinatorics/LemosO23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/LemosO23
Manoel Lemos, James G. Oxley:
An Upper Bound for the Circumference of a 3-Connected Binary Matroid. Electron. J. Comb. 30(1) (2023)
2006
[j77]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jct/LemosO06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/LemosO06
Manoel Lemos, James G. Oxley:
Matroid packing and covering with circuits through an element. J. Comb. Theory, Ser. B 96(1): 135-158 (2006)
2004
[j72]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/LemosO04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/LemosO04
Manoel Lemos, James G. Oxley:
On the minor-minimal 2-connected graphs having a fixed minor. Discret. Math. 280(1-3): 77-118 (2004)
2003
[j66]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/ejc/LemosO03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/LemosO03
Manoel Lemos, James G. Oxley:
On the minor-minimal 3-connected matroids having a fixed minor. Eur. J. Comb. 24(8): 1097-1123 (2003)
[j65]
- view
  authority control:
- export record
  dblp key:
  - journals/jgt/LemosO03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/LemosO03
Manoel Lemos, James G. Oxley:
On removable cycles through every edge. J. Graph Theory 42(2): 155-164 (2003)
2000
[j60]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/LemosO00a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/LemosO00a
Manoel Lemos, James G. Oxley:
On the 3-connected matroids that are minimal having a fixed spanning restriction. Discret. Math. 218(1-3): 131-165 (2000)
[j58]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/LemosO00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/LemosO00
Manoel Lemos, James G. Oxley:
On size, circumference and circuit removal in 3-connected matroids. Discret. Math. 220(1-3): 145-157 (2000)
[j55]
- view
  authority control:
- export record
  dblp key:
  - journals/gc/LemosOR00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/LemosOR00
Manoel Lemos, James G. Oxley, Talmage James Reid:
On the 3-Connected Matroids That are Minimal Having a Fixed Restriction. Graphs Comb. 16(3): 285-318 (2000)
1999
[j51]
- view
  authority control:
- export record
  dblp key:
  - journals/jgt/LemosO99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/LemosO99
Manoel Lemos, James G. Oxley:
On removable circuits in graphs and matroids. J. Graph Theory 30(1): 51-66 (1999)
1998
[j48]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/LemosO98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/LemosO98
Manoel Lemos, James G. Oxley:
On packing minors into connected matroids. Discret. Math. 189(1-3): 283-289 (1998)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.