scientific article; zbMATH DE number 3218576
From MaRDI portal
Publication:5345646
zbMath0134.43402MaRDI QIDQ5345646
Publication date: 1965
Full work available at URL: https://eudml.org/doc/29892
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A guide to the graph labeling zoo ⋮ On the cyclic decomposition of complete graphs into almost-bipartite graphs ⋮ Maximum packings with odd cycles ⋮ All 2-regular graphs consisting of 4-cycles are graceful ⋮ Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graph ⋮ Towards optimal embedding of an arbitrary tree in a graceful tree ⋮ Generating graceful trees from caterpillars by recursive attachment ⋮ A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\) ⋮ Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\) ⋮ Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\) ⋮ The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles ⋮ Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees ⋮ Cyclic cycle systems of the complete multipartite graph ⋮ Difference systems, graph designs, and coloring problems ⋮ Unnamed Item ⋮ Decompositions of complete graphs into isomorphic cubes ⋮ Cyclic Hamiltonian cycle systems of the complete graph. ⋮ Graceful 2-regular graphs and Skolem sequences ⋮ Generating graceful unicyclic graphs from a given forest ⋮ Binomial trees are graceful ⋮ Colouring even cycle systems ⋮ Maximum cyclic 4-cycle packings of the complete multipartite graph ⋮ Pack graphs with subgraphs of size three ⋮ 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 ⋮ Embedding an arbitrary tree in a graceful tree ⋮ \(G\)-decomposition of \(K_n\), where G has four vertices or less ⋮ \(G\)-designs and related designs ⋮ Neighbor designs ⋮ On the harmonious chromatic number of a graph ⋮ Cyclically decomposing the complete graph into cycles ⋮ On the existence of elementary Abelian cycle systems ⋮ A non-existence result on cyclic cycle-decompositions of the cocktail party graph ⋮ Some constructions for cyclic perfect cycle systems ⋮ Packing and covering of the complete graph with a graph G of four vertices or less ⋮ Mutually orthogonal cycle systems
