scientific article
From MaRDI portal
Publication:3872478
zbMath0434.05020MaRDI QIDQ3872478
Jean-Claude Bermond, Charlotte Huang, Dominique Sotteau
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complete multigraphbalanced circuit designbalanced cycle designBCDsymmetric complete directed multigraph
Related Items
Coverings of a complete graph with five-vertex and five-edge graphs ⋮ 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\) ⋮ Optimal packing of even circuits into a \(\text{DK}_ v\) ⋮ Families of proper generalized neighbor designs ⋮ Universally optimal designs under an interference model with equal left- and right-neighbor effects ⋮ A reduction of the spectrum problem for odd sun systems and the prime case ⋮ On cycle systems with specified weak chromatic number ⋮ Balanced directed cycle designs based on groups ⋮ Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph ⋮ Decompositions of complete multigraphs into cycles of varying lengths ⋮ Closed trail decompositions of complete equipartite graphs ⋮ Decompositions of complete graphs into blown-up cycles \(C_m\)[2] ⋮ Decomposition of complete bipartite graphs into generalized prisms ⋮ Enclosings of \(\lambda \)-fold 4-cycle systems ⋮ Non-binary neighbor balance circular designs for \(v=2n\) and \(\lambda =2\) ⋮ 5-cycle systems of \((\lambda + m) K_{v + 1} - \lambda K_v\) and \(\lambda K_{v + u} - \lambda K_v\) ⋮ \(G\)-designs and related designs ⋮ Cycle decompositions of complete multigraphs ⋮ Six-cycle systems ⋮ Neighbor designs and m-wheel systems ⋮ Cycle decompositions of complete multigraphs ⋮ Cycle decompositions of \(K_n\) and \(K_n-I\) ⋮ 4-cycle decompositions of \((\lambda +m)K_{v+u} {\setminus } \lambda K_v\)
