D. de Caen
List of publications from the
2001 |
17 | EE | D. de Caen:
A Note on the Ranks of Set-Inclusion Matrices.
Electr. J. Comb. 8(1): (2001) |
16 | EE | Dominique de Caen,
Edwin R. van Dam:
Fissioned Triangular Schemes via the Cross-ratio.
Eur. J. Comb. 22(3): 297-301 (2001) |
2000 |
15 | EE | D. de Caen:
Large Equiangular Sets of Lines in Euclidean Space.
Electr. J. Comb. 7: (2000) |
14 | EE | Dominique de Caen,
Zoltán Füredi:
The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane.
J. Comb. Theory, Ser. B 78(2): 274-276 (2000) |
1999 |
13 | | Dominique de Caen,
Edwin R. van Dam:
Association Schemes Related to Kasami Codes and Kerdock Sets.
Des. Codes Cryptography 18(1/3): 89-102 (1999) |
12 | EE | Dominique de Caen,
Edwin R. van Dam:
Fissions of Classical Self-Dual Association Schemes.
J. Comb. Theory, Ser. A 88(1): 167-175 (1999) |
11 | EE | Dominique de Caen,
Edwin R. van Dam,
Edward Spence:
A Nonregular Analogue of Conference Graphs.
J. Comb. Theory, Ser. A 88(1): 194-204 (1999) |
1998 |
10 | EE | D. de Caen:
An upper bound on the sum of squares of degrees in a graph.
Discrete Mathematics 185(1-3): 245-248 (1998) |
9 | EE | Dominique de Caen:
The Spectra of Complementary Subgraphs in a Strongly Regular Graph.
Eur. J. Comb. 19(5): 559-565 (1998) |
1997 |
8 | EE | D. de Caen:
A lower bound on the probability of a union.
Discrete Mathematics 169(1-3): 217-220 (1997) |
7 | EE | 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.
J. Comb. Theory, Ser. A 77(2): 268-278 (1997) |
1992 |
6 | | D. de Caen,
Chris D. Godsil,
Gordon F. Royle:
On the p-Rank of Incidence Matrices and a Bound of Bruen and Ott.
Des. Codes Cryptography 2(4): 391-394 (1992) |
1991 |
5 | EE | 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).
Discrete Mathematics 92(1-3): 65-77 (1991) |
1989 |
4 | | Dominique de Caen,
D. G. Hoffman:
Impossibility of Decomposing the Complete Graph on n Points into n-1 Isomorphic Complete Bipartite Graphs.
SIAM J. Discrete Math. 2(1): 48-50 (1989) |
1988 |
3 | EE | Dominique de Caen,
David A. Gregory:
Factorizations of symmetric designs.
J. Comb. Theory, Ser. A 49(2): 323-337 (1988) |
1986 |
2 | | D. de Caen,
Paul Erdös,
N. J. Pullmann,
Nicholas C. Wormald:
Extremal clique coverings of complementary graphs.
Combinatorica 6(4): 309-314 (1986) |
1983 |
1 | EE | Dominique de Caen:
A note on the probabilistic approach to Turán's problem.
J. Comb. Theory, Ser. B 34(3): 340-349 (1983) |