nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Almost all optimally coloured complete graphs contain a rainbow Hamilton path
|
Gould, Stephen |
|
|
156 |
C |
p. 57-100 |
artikel |
2 |
A simple proof of the Map Color Theorem for nonorientable surfaces
|
Korzhik, Vladimir P. |
|
|
156 |
C |
p. 1-17 |
artikel |
3 |
Binary scalar products
|
Kupavskii, Andrey |
|
|
156 |
C |
p. 18-30 |
artikel |
4 |
Concentration of maximum degree in random planar graphs
|
Kang, Mihyun |
|
|
156 |
C |
p. 310-342 |
artikel |
5 |
Countably determined ends and graphs
|
Kurkofka, Jan |
|
|
156 |
C |
p. 31-56 |
artikel |
6 |
Crossings between non-homotopic edges
|
Pach, János |
|
|
156 |
C |
p. 389-404 |
artikel |
7 |
Edge-partitioning 3-edge-connected graphs into paths
|
Klimošová, Tereza |
|
|
156 |
C |
p. 250-293 |
artikel |
8 |
Editorial Board
|
|
|
|
156 |
C |
p. ii |
artikel |
9 |
Local 2-separators
|
Carmesin, Johannes |
|
|
156 |
C |
p. 101-144 |
artikel |
10 |
On the hat guessing number of a planar graph class
|
Bradshaw, Peter |
|
|
156 |
C |
p. 174-193 |
artikel |
11 |
Overfullness of critical class 2 graphs with a small core degree
|
Cao, Yan |
|
|
156 |
C |
p. 145-173 |
artikel |
12 |
Spanning trees in dense directed graphs
|
Kathapurkar, Amarja |
|
|
156 |
C |
p. 223-249 |
artikel |
13 |
Structure in sparse k-critical graphs
|
Gould, Ronald J. |
|
|
156 |
C |
p. 194-222 |
artikel |
14 |
The chromatic profile of locally bipartite graphs
|
Illingworth, Freddie |
|
|
156 |
C |
p. 343-388 |
artikel |
15 |
The Turán number of blow-ups of trees
|
Grzesik, Andrzej |
|
|
156 |
C |
p. 299-309 |
artikel |
16 |
Triangle-free planar graphs with at most 64 n 0.731 3-colorings
|
Dvořák, Zdeněk |
|
|
156 |
C |
p. 294-298 |
artikel |