The SCEAS System
Navigation Menu

Search the dblp DataBase


D. de Caen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. D. de Caen, Paul Erdös, N. J. Pullmann, Nicholas C. Wormald
    Extremal clique coverings of complementary graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:4, pp:309-314 [Journal]
  2. D. de Caen
    Large Equiangular Sets of Lines in Euclidean Space. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  3. D. de Caen
    A Note on the Ranks of Set-Inclusion Matrices. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  4. D. de Caen, Chris D. Godsil, Gordon F. Royle
    On the p-Rank of Incidence Matrices and a Bound of Bruen and Ott. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1992, v:2, n:4, pp:391-394 [Journal]
  5. D. de Caen, László A. Székely
    On Dense Bipartite Graphs of Girth Eight and Upper Bounds for Certain Configurations in Planar Point-Line Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:77, n:2, pp:268-278 [Journal]
  6. D. de Caen
    An upper bound on the sum of squares of degrees in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:185, n:1-3, pp:245-248 [Journal]
  7. D. de Caen
    A lower bound on the probability of a union. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:169, n:1-3, pp:217-220 [Journal]
  8. D. de Caen, Donald L. Kreher, Stanislaw P. Radziszowski, W. H. Mills
    On the covering of t-sets with (t + 1)-sets: C(9, 5, 4) and C(10, 6, 5). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:92, n:1-3, pp:65-77 [Journal]

Search in 0.033secs, Finished in 0.034secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002