| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A lower bound for the number of orientable triangular embeddings of some complete graphs
|
Grannell, M.J.
|
|
2010
|
100 |
2 |
p. 216-225
10 p.
|
artikel
|
| 2 |
An almost quadratic bound on vertex Folkman numbers
|
Dudek, Andrzej
|
|
2010
|
100 |
2 |
p. 132-140
9 p.
|
artikel
|
| 3 |
An analogue of the Gallai–Edmonds Structure Theorem for non-zero roots of the matching polynomial
|
Ku, Cheng Yeaw
|
|
2010
|
100 |
2 |
p. 119-127
9 p.
|
artikel
|
| 4 |
Asymptotically optimal frugal colouring
|
Molloy, Michael
|
|
2010
|
100 |
2 |
p. 226-246
21 p.
|
artikel
|
| 5 |
Corrigendum to “Asymptotically optimal frugal colouring” [J. Combin. Theory Ser. B 100 (2) (2010) 226–246]
|
Molloy, Michael
|
|
2010
|
100 |
2 |
p. 247-249
3 p.
|
artikel
|
| 6 |
Countable connected-homogeneous graphs
|
Gray, R.
|
|
2010
|
100 |
2 |
p. 97-118
22 p.
|
artikel
|
| 7 |
Editorial Board
|
|
|
2010
|
100 |
2 |
p. IFC-
1 p.
|
artikel
|
| 8 |
Graph minors XXIII. Nash-Williams' immersion conjecture
|
Robertson, Neil
|
|
2010
|
100 |
2 |
p. 181-205
25 p.
|
artikel
|
| 9 |
Packing non-zero A-paths in an undirected model of group labeled graphs
|
Wollan, Paul
|
|
2010
|
100 |
2 |
p. 141-150
10 p.
|
artikel
|
| 10 |
Packing paths in complete graphs
|
Bryant, Darryn
|
|
2010
|
100 |
2 |
p. 206-215
10 p.
|
artikel
|
| 11 |
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
|
Bessy, Stéphane
|
|
2010
|
100 |
2 |
p. 176-180
5 p.
|
artikel
|
| 12 |
Small graph classes and bounded expansion
|
Dvořák, Zdeněk
|
|
2010
|
100 |
2 |
p. 171-175
5 p.
|
artikel
|
| 13 |
The average order of a subtree of a tree
|
Vince, Andrew
|
|
2010
|
100 |
2 |
p. 161-170
10 p.
|
artikel
|
| 14 |
The projective plane is a stabilizer
|
Geelen, Jim
|
|
2010
|
100 |
2 |
p. 128-131
4 p.
|
artikel
|
| 15 |
Weak hypergraph regularity and linear hypergraphs
|
Kohayakawa, Yoshiharu
|
|
2010
|
100 |
2 |
p. 151-160
10 p.
|
artikel
|
Tijdschrift beschrijving