scientific article; zbMATH DE number 3218576

Cited in

(38)

\(G\)-decomposition of \(K_n\), where G has four vertices or less
Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)
A guide to the graph labeling zoo
Packing and covering of the complete graph with a graph G of four vertices or less
A non-existence result on cyclic cycle-decompositions of the cocktail party graph
Colouring even cycle systems
Maximum cyclic 4-cycle packings of the complete multipartite graph
Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graph
Pack graphs with subgraphs of size three
The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles
\(G\)-designs and related designs
Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\)
Cyclic cycle systems of the complete multipartite graph
Mutually orthogonal cycle systems
Some constructions for cyclic perfect cycle systems
Graceful 2-regular graphs and Skolem sequences
A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\)
Edge partitions of complete multipartite graphs into equal length circuits
Embedding an arbitrary tree in a graceful tree
Cyclically decomposing the complete graph into cycles
Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees
Decomposition of the complete directed graph into k-circuits
Binomial trees are graceful
Difference systems, graph designs, and coloring problems
Another class of balanced graph designs: Balanced circuit designs
scientific article; zbMATH DE number 7742560 (Why is no real title available?)
Towards optimal embedding of an arbitrary tree in a graceful tree
Generating graceful trees from caterpillars by recursive attachment
Maximum packings with odd cycles
Cyclic Hamiltonian cycle systems of the complete graph.
On the harmonious chromatic number of a graph
Generating graceful unicyclic graphs from a given forest
On the existence of elementary Abelian cycle systems
Decomposition of \(K_n\) into circuits of odd length
Decompositions of complete graphs into isomorphic cubes
All 2-regular graphs consisting of 4-cycles are graceful
On the cyclic decomposition of complete graphs into almost-bipartite graphs
Neighbor designs

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)