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 is the first volume of a two-volume text on design theory. Since the first edition, there
has been extensive development of the theory. In particular, the growing importance of …

XII Preface solution as efficiently as possible. Most of the problems we treat have a good
algorithmic solution, but we also show how even difficult problems can be treated (for …

In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product
of the chromatic number of a graph and its complement, in terms of the order of the graph …

This article is intended as a survey, updating earlier surveys in the area. For completeness
of the presentation of both particular questions and the general area, it also contains …

Graph models are extremely useful for a large number of applications as they play an
important role as structuring tools. They allow to model net structures–like roads, computers …

The theory of 2-structures provides a convenient framework for decomposition and
transformation of mathematical systems where one or several different binary relationships …

In the most general sense, a factor of a graph G is just a spanning subgraph of G and a
graph factorization of G is a partition of the edges of G into factors. However, as we shall see …

We prove that in any N-node communication network with maximum degree d, any
deterministic oblivious algorithm for routing an arbitrary permutation requires 0 (&?/d) …

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 …