nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A fast algorithm for equitable coloring
|
Kierstead, Henry A. |
|
2010 |
30 |
2 |
p. 217-224 |
artikel |
2 |
A note on disjoint arborescences
|
Fujishige, Satoru |
|
2010 |
30 |
2 |
p. 247-252 |
artikel |
3 |
A superadditivity and submultiplicativity property for cardinalities of sumsets
|
Gyarmati, Katalin |
|
2010 |
30 |
2 |
p. 163-174 |
artikel |
4 |
Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture
|
Kierstead, Henry A. |
|
2010 |
30 |
2 |
p. 201-216 |
artikel |
5 |
New hook length formulas for binary trees
|
Han, Guo-Niu |
|
2010 |
30 |
2 |
p. 253-256 |
artikel |
6 |
On a poset of trees
|
Csikvári, Péter |
|
2010 |
30 |
2 |
p. 125-137 |
artikel |
7 |
On the pseudo-randomness of subsets related to primitive roots
|
Dartyge, Cécile |
|
2010 |
30 |
2 |
p. 139-162 |
artikel |
8 |
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
|
Yuster, Raphael |
|
2010 |
30 |
2 |
p. 239-246 |
artikel |
9 |
Set systems without a simplex or a cluster
|
Keevash, Peter |
|
2010 |
30 |
2 |
p. 175-200 |
artikel |
10 |
Structure of large incomplete sets in abelian groups
|
Vu, H. Van |
|
2010 |
30 |
2 |
p. 225-237 |
artikel |