Publication:3872478
From MaRDI portal
zbMath0434.05020MaRDI QIDQ3872478
Jean-Claude Bermond, Charlotte Huang, Dominique Sotteau
Publication date: 1978
complete multigraph; balanced circuit design; balanced cycle design; BCD; symmetric complete directed multigraph
Related Items
Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph, Cycle decompositions of complete multigraphs, Cycle decompositions of complete multigraphs, Universally optimal designs under an interference model with equal left- and right-neighbor effects, Decompositions of complete multigraphs into cycles of varying lengths, Neighbor designs and m-wheel systems, Families of proper generalized neighbor designs, Decompositions of complete graphs into blown-up cycles \(C_m\)[2], Enclosings of \(\lambda \)-fold 4-cycle systems, Non-binary neighbor balance circular designs for \(v=2n\) and \(\lambda =2\), Balanced directed cycle designs based on groups, Maximum packings with odd cycles, Packings and coverings of the complete directed multigraph with 3- and 4-circuits, Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\), Decomposition of complete bipartite graphs into generalized prisms, \(G\)-designs and related designs, Cycle decompositions of \(K_n\) and \(K_n-I\), Coverings of a complete graph with five-vertex and five-edge graphs, Optimal packing of even circuits into a \(\text{DK}_ v\), On cycle systems with specified weak chromatic number, 4-cycle decompositions of \((\lambda +m)K_{v+u} {\setminus } \lambda K_v\), 5-cycle systems of \((\lambda + m) K_{v + 1} - \lambda K_v\) and \(\lambda K_{v + u} - \lambda K_v\), Closed trail decompositions of complete equipartite graphs
