The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nicholas J. Cavenagh: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nicholas J. Cavenagh
    Further decompositions of complete tripartite graphs into 5-cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:55-81 [Journal]
  2. Nicholas J. Cavenagh, Diane Donovan, Ales Drápal
    Constructing and deconstructing latin trades. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:284, n:1-3, pp:97-105 [Journal]
  3. Nicholas J. Cavenagh, Diane Donovan, Ales Drápal
    3-Homogeneous latin trades. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:300, n:1-3, pp:57-70 [Journal]
  4. Nicholas J. Cavenagh, Diane Donovan, Emine Sule Yazici
    Minimal homogeneous latin trades. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:17, pp:2047-2055 [Journal]
  5. Nicholas J. Cavenagh
    Latin Trade Algorithms and the Smallest Critical Set in a Latin Square. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:4, pp:567-578 [Journal]
  6. Nicholas J. Cavenagh, Saad El-Zanati, Abdollah Khodkar, Charles Vanden Eynden
    On a generalization of the Oberwolfach problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2004, v:106, n:2, pp:255-275 [Journal]

  7. On The Spectrum Of Critical Sets In Back Circulant Latin Squares. [Citation Graph (, )][DBLP]


  8. Edge-Magic Group Labellings of Countable Graphs. [Citation Graph (, )][DBLP]


  9. On the number of transversals in Cayley tables of cyclic groups. [Citation Graph (, )][DBLP]


  10. Minimal homogeneous Steiner 2-(v, 3) trades. [Citation Graph (, )][DBLP]


  11. Latin bitrades derived from groups. [Citation Graph (, )][DBLP]


  12. When is a partial Latin square uniquely completable, but not its completable product? [Citation Graph (, )][DBLP]


  13. Path and cycle decompositions of complete equipartite graphs: Four parts. [Citation Graph (, )][DBLP]


  14. Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts. [Citation Graph (, )][DBLP]


Search in 0.112secs, Finished in 0.113secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002