From experimental design to cryptography, this comprehensive, easy-to-access reference
contains literally all the facts you need on combinatorial designs. It includes constructions of …

This paper surveys some recent results and new techniques concerning edge-disjoint
decompositions of K n into copies of G, where G may be a cycle, a path, or just a small …

AG‐design of order n is a decomposition of the complete graph on n vertices into edge‐
disjoint subgraphs isomorphic to G. We survey the current state of knowledge on the …

A graph which is isomorphic to its complement is said to be a self-complementary graph, or
sc-graph for short. These graphs have a high degree of structure, and yet they are far from …

The graph decomposition problem is well known. We say a subgraph G divides K m if the
edges of K m can be partitioned into copies of G. Such a partition is called a G …

We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic.
We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. We …

A G-design is called balanced if the degree of each vertex x is a constant. A G-design is
called strongly balanced if for every i= 1, 2,..., h, there exists a constant Ci such that dAi (x) …

In this paper we consider the problem of determining all values of v for which there exists a
decomposition of the complete 3-uniform hypergraph on v vertices into edge-disjoint copies …

We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic.
We want to minimize the total number of SONET add-drop multiplexers (ADMs) required …

SONET/WDM networks using wavelength add-drop multiplexing can be constructed using
certain graph decompositions used to form a grooming, consisting of unions of primitive …