default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharles Vanden Eynden
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j36]Ryan C. Bunge, Saad I. El-Zanati, Joel Jeffries, Charles Vanden Eynden:
Edge orbits and cyclic and r-pyramidal decompositions of complete uniform hypergraphs. Discret. Math. 341(12): 3348-3354 (2018)- [j35]Saad I. El-Zanati, Uthoomporn Jongthawonwuth, Heather Jordon, Charles Vanden Eynden:
Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph G where G is the union of two disjoint cycles. Eur. J. Comb. 68: 120-131 (2018) - 2017
- [j34]Ryan C. Bunge, Saad I. El-Zanati, Jeff Mudrock, Charles Vanden Eynden, Wannasiri Wannasit:
On λ-fold Rosa-type Labelings of Bipartite Multigraphs. Electron. Notes Discret. Math. 60: 11-23 (2017) - 2014
- [c1]Saad I. El-Zanati, Uthoomporn Jongthawonwuth, Heather Jordon, Charles Vanden Eynden:
On Decomposing the Complete Graph into the Union of Two Disjoint Cycles. IWOCA 2014: 153-163 - 2013
- [j33]Ryan C. Bunge, Saad I. El-Zanati, Chepina Rumsey, Charles Vanden Eynden:
On the cyclic decomposition of circulant graphs into bipartite graphs. Australas. J Comb. 56: 201-218 (2013) - [j32]Ryan C. Bunge, Avapa Chantasartrassmee, Saad I. El-Zanati, Charles Vanden Eynden:
On Cyclic Decompositions of Complete Graphs into Tripartite Graphs. J. Graph Theory 72(1): 90-111 (2013) - 2012
- [j31]Ryan C. Bunge, Saad I. El-Zanati, W. O'Hanlon, Charles Vanden Eynden:
On γ-labeling the almost-bipartite graph Pm+e. Ars Comb. 107: 65-80 (2012) - [j30]G. F. Seelinger, Papa A. Sissokho
, L. E. Spence, Charles Vanden Eynden:
Partitions of finite vector spaces over GF(2) into subspaces of dimensions 2 and s. Finite Fields Their Appl. 18(6): 1114-1132 (2012) - 2011
- [j29]Saad I. El-Zanati, G. F. Seelinger, Papa A. Sissokho, L. E. Spence, Charles Vanden Eynden:
On lambda-fold partitions of finite vector spaces and duality. Discret. Math. 311(4): 307-318 (2011)
2000 – 2009
- 2009
- [j28]Saad I. El-Zanati, G. F. Seelinger, Papa Amar Sissokho, L. E. Spence, Charles Vanden Eynden:
On partitions of finite vector spaces of low dimension over GF(2). Discret. Math. 309(14): 4727-4735 (2009) - 2008
- [j27]Andrew Blinco, Saad I. El-Zanati, G. F. Seelinger, Papa Amar Sissokho, L. E. Spence, Charles Vanden Eynden:
On vector space partitions and uniformly resolvable designs. Des. Codes Cryptogr. 48(1): 69-77 (2008) - 2007
- [j26]Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden:
Erratum to: "Star factorizations of graph products". J. Graph Theory 54(1): 88-89 (2007) - 2006
- [j25]Saad I. El-Zanati, Charles Vanden Eynden:
Decomposing complete graphs into cubes. Discuss. Math. Graph Theory 26(1): 141-147 (2006) - 2004
- [j24]Diane M. Donovan, Saad I. El-Zanati, Charles Vanden Eynden, Somporn Sutinuntopas:
Labelings of unions of up to four uniform cycles. Australas. J Comb. 29: 323-336 (2004) - [j23]Andrew Blinco, Saad I. El-Zanati, Charles Vanden Eynden:
On the cyclic decomposition of complete graphs into almost-bipartite graphs. Discret. Math. 284(1-3): 71-81 (2004) - [j22]Nicholas J. Cavenagh, Saad I. El-Zanati, Abdollah Khodkar, Charles Vanden Eynden:
On a generalization of the Oberwolfach problem. J. Comb. Theory A 106(2): 255-275 (2004) - 2003
- [j21]Charles Vanden Eynden, Reiner Martin:
A Divisibility Property of Factorials: 10833. Am. Math. Mon. 110(2): 158 (2003) - 2002
- [j20]Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden:
Factorizations of and by powers of complete graphs. Discret. Math. 243(1-3): 201-205 (2002) - [j19]Saad I. El-Zanati, Shailesh K. Tipnis, Charles Vanden Eynden:
A generalization of the Oberwolfach problem. J. Graph Theory 41(2): 151-161 (2002) - 2001
- [j18]Saad I. El-Zanati, Charles Vanden Eynden, Narong Punnim:
On the cyclic decomposition of complete graphs into bipartite graphs. Australas. J Comb. 24: 209-220 (2001) - [j17]Saad I. El-Zanati, Charles Vanden Eynden:
On a-valuations of disconnected graphs. Ars Comb. 61 (2001) - [j16]Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden, Dean G. Hoffman:
Star Decompositions of Cubes. Graphs Comb. 17(1): 55-59 (2001) - [j15]Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden:
Star factorizations of graph products. J. Graph Theory 36(2): 59-66 (2001) - [j14]Charles Vanden Eynden, Jerrold W. Grossman:
Distinguishing between the Partite Sets of a Bipartite Graph: 10740. Am. Math. Mon. 108(4): 375 (2001) - 2000
- [j13]Saad I. El-Zanati, M. J. Kenig, Charles Vanden Eynden:
Near α-labelings of bipartite graphs. Australas. J Comb. 21: 275-286 (2000) - [j12]Saad I. El-Zanati, Charles Vanden Eynden, Sidney Stubbs:
On the decomposition of Cayley graphs into isomorphic trees. Australas. J Comb. 22: 13-18 (2000) - [j11]Saad I. El-Zanati, Charles Vanden Eynden:
On Graphs with Strong a-valuations. Ars Comb. 56 (2000) - [j10]Saad I. El-Zanati, Charles Vanden Eynden:
Factorizations of complete multipartite graphs into generalized cubes. J. Graph Theory 33(3): 144-150 (2000) - [j9]Charles Vanden Eynden:
Problem 10833. Am. Math. Mon. 107(9): 863 (2000)
1990 – 1999
- 1999
- [j8]Saad I. El-Zanati, Charles Vanden Eynden:
Factorizations of Km, n into Spanning Trees. Graphs Comb. 15(3): 287-293 (1999) - 1998
- [j7]Saad I. El-Zanati, Michael Plantholt, Charles Vanden Eynden:
Graph Decompositions into Generalized Cubes. Ars Comb. 49 (1998) - [j6]Saad I. El-Zanati, Charles Vanden Eynden:
Cycle factorizations of cycle products. Discret. Math. 189(1-3): 267-275 (1998) - 1997
- [j5]Charles Vanden Eynden:
Decomposition of Complete Bipartite Graphs. Ars Comb. 46 (1997) - [j4]Peter Adams, Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden:
d-Cube decompositions ofKn/Km. Graphs Comb. 13(1): 1-7 (1997)
1980 – 1989
- 1980
- [j3]Richard Crittenden, Charles Vanden Eynden:
Completing Partial Latin Squares. J. Comb. Theory A 28(2): 125-129 (1980)
1970 – 1979
- 1978
- [j2]Charles Vanden Eynden:
Countable sequenceable groups. Discret. Math. 23(3): 317-318 (1978) - 1977
- [j1]Charles Vanden Eynden:
On a paper of lake about infinite graphs. Discret. Math. 18(1): 97 (1977)
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-10-07 22:14 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:
