scientific article; zbMATH DE number 3218576

Cited in

(39)

On the existence of elementary Abelian cycle systems
A non-existence result on cyclic cycle-decompositions of the cocktail party graph
Packing and covering of the complete graph with a graph G of four vertices or less
Difference systems, graph designs, and coloring problems
Decompositions of complete graphs into isomorphic cubes
Graceful 2-regular graphs and Skolem sequences
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
\(G\)-decomposition of \(K_n\), where G has four vertices or less
Neighbor designs
A guide to the graph labeling zoo
Maximum packings with odd cycles
All 2-regular graphs consisting of 4-cycles are graceful
Embeddings of m-cycle systems and incomplete m-cycle systems: m 14
The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-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
Pack graphs with subgraphs of size three
Any tree with m edges can be embedded in a graceful tree with less than 4m edges and in a graceful planar graph
Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees
Colouring even cycle systems
Maximum cyclic 4-cycle packings of the complete multipartite graph
Some constructions for cyclic perfect cycle systems
Towards optimal embedding of an arbitrary tree in a graceful tree
Generating graceful trees from caterpillars by recursive attachment
Generating graceful unicyclic graphs from a given forest
Binomial trees are graceful
Mutually orthogonal cycle systems
scientific article; zbMATH DE number 7742560 (Why is no real title available?)
Cyclic cycle systems of the complete multipartite graph
Decomposition of complete graphs into forests with six edges
Embedding an arbitrary tree in a graceful tree
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}\)

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 Q5345646)