| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A local epsilon version of Reed's Conjecture
|
Kelly, Tom
|
|
|
141 |
C |
p. 181-222
|
artikel
|
| 2 |
Approximate Moore Graphs are good expanders
|
Dinitz, Michael
|
|
|
141 |
C |
p. 240-263
|
artikel
|
| 3 |
A refinement of choosability of graphs
|
Zhu, Xuding
|
|
|
141 |
C |
p. 143-164
|
artikel
|
| 4 |
7-Connected graphs are 4-ordered
|
McCarty, Rose
|
|
|
141 |
C |
p. 115-135
|
artikel
|
| 5 |
Editorial Board
|
|
|
|
141 |
C |
p. ii
|
artikel
|
| 6 |
Factorizing regular graphs
|
Thomassen, Carsten
|
|
|
141 |
C |
p. 343-351
|
artikel
|
| 7 |
Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor
|
Kawarabayashi, Ken-ichi
|
|
|
141 |
C |
p. 165-180
|
artikel
|
| 8 |
N-detachable pairs in 3-connected matroids I: Unveiling X
|
Brettell, Nick
|
|
|
141 |
C |
p. 295-342
|
artikel
|
| 9 |
On a conjecture of Bondy and Vince
|
Gao, Jun
|
|
|
141 |
C |
p. 136-142
|
artikel
|
| 10 |
On cubic graphical regular representations of finite simple groups
|
Xia, Binzhou
|
|
|
141 |
C |
p. 1-30
|
artikel
|
| 11 |
On 1-factors with prescribed lengths in tournaments
|
Kang, Dong Yeap
|
|
|
141 |
C |
p. 31-71
|
artikel
|
| 12 |
On Frank's conjecture on k-connected orientations
|
Durand de Gevigney, Olivier
|
|
|
141 |
C |
p. 105-114
|
artikel
|
| 13 |
Ranking tournaments with no errors I: Structural description
|
Chen, Xujin
|
|
|
141 |
C |
p. 264-294
|
artikel
|
| 14 |
The complexity of perfect matchings and packings in dense hypergraphs
|
Han, Jie
|
|
|
141 |
C |
p. 72-104
|
artikel
|
| 15 |
The genus of complete 3-uniform hypergraphs
|
Jing, Yifan
|
|
|
141 |
C |
p. 223-239
|
artikel
|
Tijdschrift beschrijving