scientific article; zbMATH DE number 3218576

From MaRDI portal
Publication:5345646

zbMath0134.43402MaRDI QIDQ5345646

Anton Kotzig

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 zooOn the cyclic decomposition of complete graphs into almost-bipartite graphsMaximum packings with odd cyclesAll 2-regular graphs consisting of 4-cycles are gracefulAny tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graphTowards optimal embedding of an arbitrary tree in a graceful treeGenerating graceful trees from caterpillars by recursive attachmentA 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-cyclesConstruction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled treesCyclic cycle systems of the complete multipartite graphDifference systems, graph designs, and coloring problemsUnnamed ItemDecompositions of complete graphs into isomorphic cubesCyclic Hamiltonian cycle systems of the complete graph.Graceful 2-regular graphs and Skolem sequencesGenerating graceful unicyclic graphs from a given forestBinomial trees are gracefulColouring even cycle systemsMaximum cyclic 4-cycle packings of the complete multipartite graphPack graphs with subgraphs of size threeAnother class of balanced graph designs: Balanced circuit designsEdge partitions of complete multipartite graphs into equal length circuitsDecomposition of the complete directed graph into k-circuitsDecomposition of \(K_n\) into circuits of odd lengthEmbedding an arbitrary tree in a graceful tree\(G\)-decomposition of \(K_n\), where G has four vertices or less\(G\)-designs and related designsNeighbor designsOn the harmonious chromatic number of a graphCyclically decomposing the complete graph into cyclesOn the existence of elementary Abelian cycle systemsA non-existence result on cyclic cycle-decompositions of the cocktail party graphSome constructions for cyclic perfect cycle systemsPacking and covering of the complete graph with a graph G of four vertices or lessMutually orthogonal cycle systems