Sciweavers

310 search results - page 26 / 62
» dam 2008
Sort
View
DAM
1998
92views more  DAM 1998»
13 years 9 months ago
Embedding ladders and caterpillars into the hypercube
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,...
DAM
1998
67views more  DAM 1998»
13 years 9 months ago
A Graph-theoretic Generalization of the Sauer-Shelah Lemma
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...
Nicolò Cesa-Bianchi, David Haussler
DAM
1999
81views more  DAM 1999»
13 years 9 months ago
On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs
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...
Jørgen Bang-Jensen, Gregory Gutin
DAM
1999
81views more  DAM 1999»
13 years 9 months ago
On the Extension of Bipartite to Parity Graphs
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...
Serafino Cicerone, Gabriele Di Stefano
DAM
2000
121views more  DAM 2000»
13 years 9 months ago
Chordality and 2-factors in Tough Graphs
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...