scientific article; zbMATH DE number 3238443

Cited in

(32)

Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph
On the existence of elementary Abelian cycle systems
A non-existence result on cyclic cycle-decompositions of the cocktail party graph
Difference systems, graph designs, and coloring problems
Another class of balanced graph designs: Balanced circuit designs
Edge partitions of complete multipartite graphs into equal length circuits
Decomposition of the complete directed graph into k-circuits
Decomposition of K_n into circuits of odd length
Neighbor designs
Decompositions of complete graphs into isomorphic bipartite subgraphs
Maximum packings with odd cycles
Cyclic Hamiltonian cycle systems of the complete graph.
\(G\)-designs and related designs
On the harmonious chromatic number of a graph
Cyclically decomposing the complete graph into cycles
On the cyclic decomposition of complete graphs into almost-bipartite graphs
Six-cycle systems
Squashing minimum coverings of 6-cycles into minimum coverings of triples
Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
On cyclic decompositions of the complete graph into the 2-regular graphs
Colouring even cycle systems
Maximum cyclic 4-cycle packings of the complete multipartite graph
Some constructions for cyclic perfect cycle systems
Signed Langford sequences and directed cyclic cycle systems
Mutually orthogonal cycle systems
Cyclic cycle systems of the complete multipartite graph
A complete solution to the infinite Oberwolfach problem
Automorphic decompositions of graphs
Neighbor designs and m-wheel systems
A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\)
Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\)
Cyclic Hamiltonian cycle systems of the -fold complete and cocktail party graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5525915)