nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An algorithm computing combinatorial specifications of permutation classes
|
Bassino, Frédérique |
|
2017 |
224 |
C |
p. 16-44 29 p. |
artikel |
2 |
A permutation code preserving a double Eulerian bistatistic
|
Baril, Jean-Luc |
|
2017 |
224 |
C |
p. 9-15 7 p. |
artikel |
3 |
A sufficient condition for a planar graph to be 4 -choosable
|
Xu, Renyu |
|
2017 |
224 |
C |
p. 120-122 3 p. |
artikel |
4 |
Computing the coarseness with strips or boxes
|
Díaz-Báñez, J.M. |
|
2017 |
224 |
C |
p. 80-90 11 p. |
artikel |
5 |
Cycles embedding in folded hypercubes under the conditional fault model
|
Cheng, Dongqin |
|
2017 |
224 |
C |
p. 60-68 9 p. |
artikel |
6 |
Editorial Board
|
|
|
2017 |
224 |
C |
p. v- 1 p. |
artikel |
7 |
Extremal anti-forcing numbers of perfect matchings of graphs
|
Deng, Kai |
|
2017 |
224 |
C |
p. 69-79 11 p. |
artikel |
8 |
Graphs with integer matching polynomial zeros
|
Akbari, S. |
|
2017 |
224 |
C |
p. 1-8 8 p. |
artikel |
9 |
On well-covered pentagonalizations of the plane
|
Finbow, Arthur S. |
|
2017 |
224 |
C |
p. 91-105 15 p. |
artikel |
10 |
The fast search number of a Cartesian product of graphs
|
Xue, Yuan |
|
2017 |
224 |
C |
p. 106-119 14 p. |
artikel |
11 |
Zero forcing propagation time on oriented graphs
|
Berliner, Adam |
|
2017 |
224 |
C |
p. 45-59 15 p. |
artikel |