83 search results - page 9 / 17 » combinatorics 2002 |
COMBINATORICS
2002
13 years 7 months ago
2002
We obtain a characterization of (321, 3
ENTCS
2002
13 years 7 months ago
2002
COMBINATORICS
2002
13 years 7 months ago
2002
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...
COMBINATORICS
2002
13 years 7 months ago
2002
Let S be a subset of the units in Zn. Let be a circulant graph of order n (a Cayley graph of Zn) such that if ij E(), then i - j (mod n) S. Toida conjectured that if is another...
COMBINATORICS
2002
13 years 7 months ago
2002
A graph is f-choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colors from the lists. The sum choice number is the minimum...