default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDominique de Caen
Person information
- affiliation: Queen's University, Kingston, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[j19]Dominique de Caen, Dmitry Fon-Der-Flaass:
Distance Regular Covers of Complete Graphs from Latin Squares. Des. Codes Cryptogr. 34(2-3): 149-153 (2005)- 2001
- [j18]D. de Caen:
A Note on the Ranks of Set-Inclusion Matrices. Electron. J. Comb. 8(1) (2001) - [j17]Dominique de Caen, Edwin R. van Dam
:
Fissioned Triangular Schemes via the Cross-ratio. Eur. J. Comb. 22(3): 297-301 (2001) - 2000
- [j16]D. de Caen:
Large Equiangular Sets of Lines in Euclidean Space. Electron. J. Comb. 7 (2000) - [j15]Dominique de Caen, Zoltán Füredi:
The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane. J. Comb. Theory B 78(2): 274-276 (2000)
1990 – 1999
- 1999
- [j14]Dominique de Caen, Edwin R. van Dam:
Association Schemes Related to Kasami Codes and Kerdock Sets. Des. Codes Cryptogr. 18(1/3): 89-102 (1999) - [j13]Dominique de Caen, Edwin R. van Dam:
Fissions of Classical Self-Dual Association Schemes. J. Comb. Theory A 88(1): 167-175 (1999) - [j12]Dominique de Caen, Edwin R. van Dam, Edward Spence:
A Nonregular Analogue of Conference Graphs. J. Comb. Theory A 88(1): 194-204 (1999) - 1998
- [j11]D. de Caen:
An upper bound on the sum of squares of degrees in a graph. Discret. Math. 185(1-3): 245-248 (1998) - [j10]Dominique de Caen:
The Spectra of Complementary Subgraphs in a Strongly Regular Graph. Eur. J. Comb. 19(5): 559-565 (1998) - 1997
- [j9]D. de Caen:
A lower bound on the probability of a union. Discret. Math. 169(1-3): 217-220 (1997) - [j8]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 A 77(2): 268-278 (1997) - 1993
- [j7]Donald L. Kreher, Dominique de Caen, Sylvia A. Hobart, Earl S. Kramer, Stanislaw P. Radziszowski:
The parameters 4-(12, 6, 6) and related t-designs. Australas. J Comb. 7: 3-20 (1993) - 1992
- [j6]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 Cryptogr. 2(4): 391-394 (1992) - 1991
- [j5]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). Discret. Math. 92(1-3): 65-77 (1991)
1980 – 1989
- 1989
- [j4]Dominique de Caen, D. G. Hoffman:
Impossibility of Decomposing the Complete Graph on n Points into n-1 Isomorphic Complete Bipartite Graphs. SIAM J. Discret. Math. 2(1): 48-50 (1989) - 1988
- [j3]Dominique de Caen, David A. Gregory:
Factorizations of symmetric designs. J. Comb. Theory A 49(2): 323-337 (1988) - 1986
- [j2]D. de Caen, Paul Erdös, Norman J. Pullmann, Nicholas C. Wormald:
Extremal clique coverings of complementary graphs. Comb. 6(4): 309-314 (1986) - 1983
- [j1]Dominique de Caen:
A note on the probabilistic approach to Turán's problem. J. Comb. Theory B 34(3): 340-349 (1983)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
