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...
Sergei L. Bezrukov, Burkhard Monien, Walter Unger,...
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...
We survey results on the sequential and parallel complexity of hamiltonian path and cycle problems in various classes of digraphs which generalize tournaments. We give detailed in...
Parity graphs form a superclass of bipartite and distance-hereditary graphs. Since their introduction, all the algorithms proposed as solutions to the recognition problem and othe...
A graph G is chordal if it contains no chordless cycle of length at least four and is k-chordal if a longest chordless cycle in G has length at most k. In this note it is proved t...
Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, He...