Sciweavers

11949 search results - page 173 / 2390
» Some results on (a:b)-choosability
Sort
View
ACTA
1998
64views more  ACTA 1998»
15 years 1 months ago
Converting Untyped Formulas to Typed Ones
We observe that every rst-order logic formula over the untyped version of some many-sorted vocabulary is equivalent to a union of manysorted formulas over that vocabulary. This re...
Jan Van den Bussche, Luca Cabibbo
COMBINATORICS
1998
76views more  COMBINATORICS 1998»
15 years 1 months ago
An Exploration of the Permanent-Determinant Method
The permanent-determinant method and its generalization, the HafnianPfaffian method, are methods to enumerate perfect matchings of plane graphs that were discovered by P. W. Kaste...
Greg Kuperberg
DAM
1998
92views more  DAM 1998»
15 years 1 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,...
DM
1998
56views more  DM 1998»
15 years 1 months ago
Factoring cardinal product graphs in polynomial time
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
Wilfried Imrich
IVS
2002
50views more  IVS 2002»
15 years 1 months ago
Rapid, Serial and Visual: a presentation technique with potential
This commentary addresses the recently exploited presentation technique called Rapid Serial Visual Presentation, or RSVP, and identifies a number of applications. It describes a n...
Robert Spence