scientific article; zbMATH DE number 3238443

From MaRDI portal
Publication:5525915

zbMath0147.42803MaRDI QIDQ5525915

Alexander Rosa

Publication date: 1966

Full work available at URL: https://eudml.org/doc/30131

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (32)

On the cyclic decomposition of complete graphs into almost-bipartite graphsMaximum packings with odd cyclesA 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}\)Unnamed ItemCyclic Hamiltonian cycle systems of the complete graph minus a 1-factorCyclic cycle systems of the complete multipartite graphA complete solution to the infinite Oberwolfach problemDifference systems, graph designs, and coloring problemsCyclic Hamiltonian cycle systems of the complete graph.Automorphic decompositions of graphsOn cyclic decompositions of the complete graph into the 2-regular graphsColouring even cycle systemsMaximum cyclic 4-cycle packings of the complete multipartite graphAnother class of balanced graph designs: Balanced circuit designsCyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphsEdge partitions of complete multipartite graphs into equal length circuitsDecomposition of the complete directed graph into k-circuitsDecomposition of \(K_n\) into circuits of odd length\(G\)-designs and related designsNeighbor designsDirected cyclic Hamiltonian cycle systems of the complete symmetric digraphSix-cycle systemsNeighbor designs and m-wheel systemsOn 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 systemsMutually orthogonal cycle systemsSquashing minimum coverings of 6-cycles into minimum coverings of triplesDecompositions of complete graphs into isomorphic bipartite subgraphs




This page was built for publication: