nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A lower bound on the tree-width of graphs with irrelevant vertices
|
Adler, Isolde |
|
2019 |
137 |
C |
p. 126-136 |
artikel |
2 |
A proof of the Erdős–Sands–Sauer–Woodrow conjecture
|
Bousquet, Nicolas |
|
2019 |
137 |
C |
p. 316-319 |
artikel |
3 |
Arc-transitive digraphs of given out-valency and with blocks of given size
|
Morgan, Luke |
|
2019 |
137 |
C |
p. 118-125 |
artikel |
4 |
Asymptotics for the Turán number of Berge-K 2,t
|
Gerbner, Dániel |
|
2019 |
137 |
C |
p. 264-290 |
artikel |
5 |
Avoiding long Berge cycles
|
Füredi, Zoltán |
|
2019 |
137 |
C |
p. 55-64 |
artikel |
6 |
Balanced independent sets in graphs omitting large cliques
|
Laflamme, Claude |
|
2019 |
137 |
C |
p. 1-9 |
artikel |
7 |
Core forging and local limit theorems for the k-core of random graphs
|
Coja-Oghlan, Amin |
|
2019 |
137 |
C |
p. 178-231 |
artikel |
8 |
Cut-norm and entropy minimization over weak⁎ limits
|
Doležal, Martin |
|
2019 |
137 |
C |
p. 232-263 |
artikel |
9 |
Cycle covers (III) – Compatible circuit decomposition and K 5-transition minor
|
Fleischner, Herbert |
|
2019 |
137 |
C |
p. 25-54 |
artikel |
10 |
Directed Ramsey number for trees
|
Bucić, Matija |
|
2019 |
137 |
C |
p. 145-177 |
artikel |
11 |
Editorial Board
|
|
|
2019 |
137 |
C |
p. ii |
artikel |
12 |
Kirszbraun-type theorems for graphs
|
Chandgotia, Nishant |
|
2019 |
137 |
C |
p. 10-24 |
artikel |
13 |
Many touchings force many crossings
|
Pach, János |
|
2019 |
137 |
C |
p. 104-111 |
artikel |
14 |
Minimum number of edges that occur in odd cycles
|
Grzesik, Andrzej |
|
2019 |
137 |
C |
p. 65-103 |
artikel |
15 |
Multiple list colouring triangle free planar graphs
|
Jiang, Yiting |
|
2019 |
137 |
C |
p. 112-117 |
artikel |
16 |
Symmetry properties of generalized graph truncations
|
Eiben, Eduard |
|
2019 |
137 |
C |
p. 291-315 |
artikel |
17 |
Treewidth of graphs with balanced separations
|
Dvořák, Zdeněk |
|
2019 |
137 |
C |
p. 137-144 |
artikel |