DAM
1998
13 years 11 months ago
1998
We show a natural graph-theoretic generalization of the Sauer–Shelah lemma. This result is applied to bound the ‘∞ and L1 packing numbers of classes of functions whose range...
DAM
1998
13 years 11 months ago
1998
DAM
1998
13 years 11 months ago
1998
We present embeddings of generalized ladders as subgraphs into the hypercube. By embedding caterpillars into ladders, we obtain embeddings of caterpillars into the hypercube. In t...
DAM
1998
13 years 11 months ago
1998
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...
DAM
1998
13 years 11 months ago
1998
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which c...
DAM
1998
13 years 11 months ago
1998
We consider edge-coloured complete graphs. A path or cycle Q is called properly coloured (PC) if any two adjacent edges of Q differ in colour. Our note is inspired by the followi...
DAM
1998
13 years 11 months ago
1998
We study a discrete problem of scheduling activities of several types under the constraint that at most a single activity can be scheduled to any one period. Applications of such ...
DAM
1998
13 years 11 months ago
1998