Charles Vanden Eynden

According to our database1, Charles Vanden Eynden authored at least 37 papers between 1977 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph <i>G</i> where <i>G</i> is the union of two disjoint cycles.
Eur. J. Comb., 2018

Edge orbits and cyclic and r-pyramidal decompositions of complete uniform hypergraphs.
Discret. Math., 2018

2017
On λ-fold Rosa-type Labelings of Bipartite Multigraphs.
Electron. Notes Discret. Math., 2017

2014
On Decomposing the Complete Graph into the Union of Two Disjoint Cycles.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013
On Cyclic Decompositions of Complete Graphs into Tripartite Graphs.
J. Graph Theory, 2013

On the cyclic decomposition of circulant graphs into bipartite graphs.
Australas. J Comb., 2013

2012
Partitions of finite vector spaces over GF(2) into subspaces of dimensions 2 and s.
Finite Fields Their Appl., 2012

On γ-labeling the almost-bipartite graph P<sub>m</sub>+e.
Ars Comb., 2012

2011
On lambda-fold partitions of finite vector spaces and duality.
Discret. Math., 2011

2009
On partitions of finite vector spaces of low dimension over GF(2).
Discret. Math., 2009

2008
On vector space partitions and uniformly resolvable designs.
Des. Codes Cryptogr., 2008

2007
Erratum to: "Star factorizations of graph products".
J. Graph Theory, 2007

2006
Decomposing complete graphs into cubes.
Discuss. Math. Graph Theory, 2006

2004
On a generalization of the Oberwolfach problem.
J. Comb. Theory A, 2004

On the cyclic decomposition of complete graphs into almost-bipartite graphs.
Discret. Math., 2004

Labelings of unions of up to four uniform cycles.
Australas. J Comb., 2004

2003
A Divisibility Property of Factorials: 10833.
Am. Math. Mon., 2003

2002
A generalization of the Oberwolfach problem.
J. Graph Theory, 2002

Factorizations of and by powers of complete graphs.
Discret. Math., 2002

2001
Distinguishing between the Partite Sets of a Bipartite Graph: 10740.
Am. Math. Mon., 2001

Star factorizations of graph products.
J. Graph Theory, 2001

Star Decompositions of Cubes.
Graphs Comb., 2001

On a-valuations of disconnected graphs.
Ars Comb., 2001

On the cyclic decomposition of complete graphs into bipartite graphs.
Australas. J Comb., 2001

2000
Problem 10833.
Am. Math. Mon., 2000

Factorizations of complete multipartite graphs into generalized cubes.
J. Graph Theory, 2000

On Graphs with Strong a-valuations.
Ars Comb., 2000

Near α-labelings of bipartite graphs.
Australas. J Comb., 2000

On the decomposition of Cayley graphs into isomorphic trees.
Australas. J Comb., 2000

1999
Factorizations of Km, n into Spanning Trees.
Graphs Comb., 1999

1998
Cycle factorizations of cycle products.
Discret. Math., 1998

Graph Decompositions into Generalized Cubes.
Ars Comb., 1998

1997
<i>d</i>-Cube decompositions of<i>K</i><sub>n</sub>/<i>K</i><sub>m</sub>.
Graphs Comb., 1997

Decomposition of Complete Bipartite Graphs.
Ars Comb., 1997

1980
Completing Partial Latin Squares.
J. Comb. Theory A, 1980

1978
Countable sequenceable groups.
Discret. Math., 1978

1977
On a paper of lake about infinite graphs.
Discret. Math., 1977


  Loading...