nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A localization method in Hamiltonian graph theory
|
Asratian, Armen S. |
|
|
148 |
C |
p. 209-238 |
artikel |
2 |
A Menger-like property of tree-cut width
|
Giannopoulou, Archontia C. |
|
|
148 |
C |
p. 1-22 |
artikel |
3 |
Approximating infinite graphs by normal trees
|
Kurkofka, Jan |
|
|
148 |
C |
p. 173-183 |
artikel |
4 |
A scaling limit for the length of the longest cycle in a sparse random graph
|
Anastos, Michael |
|
|
148 |
C |
p. 184-208 |
artikel |
5 |
Editorial Board
|
|
|
|
148 |
C |
p. ii |
artikel |
6 |
K r -factors in graphs with low independence number
|
Knierim, Charlotte |
|
|
148 |
C |
p. 60-83 |
artikel |
7 |
Long cycles, heavy cycles and cycle decompositions in digraphs
|
Knierim, Charlotte |
|
|
148 |
C |
p. 125-148 |
artikel |
8 |
On the rational Turán exponents conjecture
|
Kang, Dong Yeap |
|
|
148 |
C |
p. 149-172 |
artikel |
9 |
Regular Cayley maps for dihedral groups
|
Kovács, István |
|
|
148 |
C |
p. 84-124 |
artikel |
10 |
The feasible region of hypergraphs
|
Liu, Xizhi |
|
|
148 |
C |
p. 23-59 |
artikel |
11 |
The structure of hypergraphs without long Berge cycles
|
Győri, Ervin |
|
|
148 |
C |
p. 239-250 |
artikel |