| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A polynomial time algorithm to compute the connected treewidth of a series–parallel graph
|
Mescoff, Guillaume
|
|
|
312 |
C |
p. 72-85
|
artikel
|
| 2 |
Computing the zig-zag number of directed graphs
|
Dourado, Mitre C.
|
|
|
312 |
C |
p. 86-105
|
artikel
|
| 3 |
Dichotomizing k -vertex-critical H -free graphs for H of order four
|
Cameron, Ben
|
|
|
312 |
C |
p. 106-115
|
artikel
|
| 4 |
Editorial Board
|
|
|
|
312 |
C |
p. ii
|
artikel
|
| 5 |
Obstructions for partitioning into forests and outerplanar graphs
|
Kim, Ringi
|
|
|
312 |
C |
p. 15-28
|
artikel
|
| 6 |
Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria
|
Ganian, Robert
|
|
|
312 |
C |
p. 1-2
|
artikel
|
| 7 |
Rainbow independent sets on dense graph classes
|
Kim, Jinha
|
|
|
312 |
C |
p. 45-51
|
artikel
|
| 8 |
The micro-world of cographs
|
Alecu, Bogdan
|
|
|
312 |
C |
p. 3-14
|
artikel
|
| 9 |
Thinness of product graphs
|
Bonomo-Braberman, Flavia
|
|
|
312 |
C |
p. 52-71
|
artikel
|
| 10 |
Vapnik–Chervonenkis dimension and density on Johnson and Hamming graphs
|
Adler, Isolde
|
|
|
312 |
C |
p. 29-44
|
artikel
|
Tijdschrift beschrijving