The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

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

Publications of Author

  1. E. J. Farrell
    An introduction to matching polynomials. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:27, n:1, pp:75-86 [Journal]
  2. E. J. Farrell
    On a general class of graph polynomials. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:26, n:1, pp:111-122 [Journal]
  3. E. J. Farrell
    Defect-d matchings in graphs with cyclomatic numbers 0, 1 and 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:33, n:3, pp:259-266 [Journal]
  4. E. J. Farrell
    Cycle decompositions of complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:143-156 [Journal]
  5. E. J. Farrell
    A note on the circuit polynomials and characteristic polynomials of wheels and ladders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:39, n:1, pp:31-36 [Journal]
  6. E. J. Farrell
    Forest decompositions of ladders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:267-274 [Journal]
  7. E. J. Farrell, J. M. Guo, G. M. Constantine
    On matching coefficients. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:89, n:2, pp:203-210 [Journal]
  8. Robert A. Beezer, E. J. Farrell
    The matching polynomial of a regular graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:137, n:1-3, pp:7-18 [Journal]

Search in 0.004secs, Finished in 0.004secs
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