Nicholas J. Cavenagh

◀ ▶ joint publications with Benjamin R. Smith

> Home > Persons > Nicholas J. Cavenagh

Publications

2012
[j30]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/SmithC12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/SmithC12
Benjamin R. Smith, Nicholas J. Cavenagh:
Decomposing complete equipartite graphs into odd square-length cycles: Number of parts even. Discret. Math. 312(10): 1611-1622 (2012)
2010
[j25]
- view
  authority control:
- export record
  dblp key:
  - journals/combinatorics/SmithC10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/SmithC10
Benjamin R. Smith, Nicholas J. Cavenagh:
Decomposing Complete Equipartite Graphs into Short Odd Cycles. Electron. J. Comb. 17(1) (2010)
[j23]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/BillingtonCS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/BillingtonCS10
Elizabeth J. Billington, Nicholas J. Cavenagh, Benjamin R. Smith:
Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts. Discret. Math. 310(2): 241-254 (2010)
2009
[j22]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/BillingtonCS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/BillingtonCS09
Elizabeth J. Billington, Nicholas J. Cavenagh, Benjamin R. Smith:
Path and cycle decompositions of complete equipartite graphs: Four parts. Discret. Math. 309(10): 3061-3073 (2009)

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.