| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A decomposition of the space of TU-games using addition and transfer invariance
|
Béal, Sylvain
|
|
2015
|
184 |
C |
p. 1-13
13 p.
|
artikel
|
| 2 |
A note on total domination and 2-rainbow domination in graphs
|
Furuya, Michitaka
|
|
2015
|
184 |
C |
p. 229-230
2 p.
|
artikel
|
| 3 |
Approximate tradeoffs on weighted labeled matroids
|
Gourvès, Laurent
|
|
2015
|
184 |
C |
p. 154-166
13 p.
|
artikel
|
| 4 |
Asymptotic surviving rate of trees with multiple fire sources
|
Costa, Vitor
|
|
2015
|
184 |
C |
p. 14-19
6 p.
|
artikel
|
| 5 |
AVD-total-colouring of complete equipartite graphs
|
Luiz, Atílio G.
|
|
2015
|
184 |
C |
p. 189-195
7 p.
|
artikel
|
| 6 |
Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns
|
Cooper, Martin C.
|
|
2015
|
184 |
C |
p. 89-113
25 p.
|
artikel
|
| 7 |
Characterization of split graphs with at most four distinct eigenvalues
|
Ghorbani, Modjtaba
|
|
2015
|
184 |
C |
p. 231-236
6 p.
|
artikel
|
| 8 |
(3, 1)-Choosability of toroidal graphs with some forbidden short cycles
|
Jing, Yubo
|
|
2015
|
184 |
C |
p. 243-247
5 p.
|
artikel
|
| 9 |
Computational complexity of minimum P 4 vertex cover problem for regular and K 1 , 4 -free graphs
|
Safina Devi, N.
|
|
2015
|
184 |
C |
p. 114-121
8 p.
|
artikel
|
| 10 |
Contents
|
|
|
2015
|
184 |
C |
p. v-vi
nvt p.
|
artikel
|
| 11 |
Degree conditions for graphs to be maximally k -restricted edge connected and super k -restricted edge connected
|
Wang, Shiying
|
|
2015
|
184 |
C |
p. 258-263
6 p.
|
artikel
|
| 12 |
Diagnosis of constant faults in read-once contact networks over finite bases
|
Busbait, Monther
|
|
2015
|
184 |
C |
p. 76-88
13 p.
|
artikel
|
| 13 |
Diameters of Cayley graphs generated by transposition trees
|
Kraft, Benjamin
|
|
2015
|
184 |
C |
p. 178-188
11 p.
|
artikel
|
| 14 |
Domination, coloring and stability in P 5 -reducible graphs
|
Fouquet, Jean-Luc
|
|
2015
|
184 |
C |
p. 122-129
8 p.
|
artikel
|
| 15 |
Domination versus disjunctive domination in trees
|
Henning, Michael A.
|
|
2015
|
184 |
C |
p. 171-177
7 p.
|
artikel
|
| 16 |
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
|
Berry, Anne
|
|
2015
|
184 |
C |
p. 50-61
12 p.
|
artikel
|
| 17 |
Equitable total-coloring of subcubic graphs
|
Gui, Hao
|
|
2015
|
184 |
C |
p. 167-170
4 p.
|
artikel
|
| 18 |
New bounds of degree-based topological indices for some classes of c -cyclic graphs
|
Bianchi, Monica
|
|
2015
|
184 |
C |
p. 62-75
14 p.
|
artikel
|
| 19 |
On constructing complete permutation polynomials over finite fields of even characteristic
|
Wu, Baofeng
|
|
2015
|
184 |
C |
p. 213-222
10 p.
|
artikel
|
| 20 |
On the inverse sum indeg index
|
Sedlar, Jelena
|
|
2015
|
184 |
C |
p. 202-212
11 p.
|
artikel
|
| 21 |
On the Kirchhoff index of graphs with diameter 2
|
Palacios, José Luis
|
|
2015
|
184 |
C |
p. 196-201
6 p.
|
artikel
|
| 22 |
Ordered biclique partitions and communication complexity problems
|
Shigeta, Manami
|
|
2015
|
184 |
C |
p. 248-252
5 p.
|
artikel
|
| 23 |
Parameterized clique on inhomogeneous random graphs
|
Friedrich, Tobias
|
|
2015
|
184 |
C |
p. 130-138
9 p.
|
artikel
|
| 24 |
Pebble exchange on graphs
|
Fujita, Shinya
|
|
2015
|
184 |
C |
p. 139-145
7 p.
|
artikel
|
| 25 |
Proximity, remoteness and minimum degree
|
Dankelmann, Peter
|
|
2015
|
184 |
C |
p. 223-228
6 p.
|
artikel
|
| 26 |
Quasi-Hamiltonian cycles in k -strong multipartite tournaments
|
Surmacs, Michel
|
|
2015
|
184 |
C |
p. 253-257
5 p.
|
artikel
|
| 27 |
The chromatic discrepancy of graphs
|
Aravind, N.R.
|
|
2015
|
184 |
C |
p. 40-49
10 p.
|
artikel
|
| 28 |
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
|
Janczewski, Robert
|
|
2015
|
184 |
C |
p. 237-242
6 p.
|
artikel
|
| 29 |
The minimum number of minimal codewords in an [ n , k ] -code and in graphic codes
|
Alahmadi, A.
|
|
2015
|
184 |
C |
p. 32-39
8 p.
|
artikel
|
| 30 |
The probabilistic approach to limited packings in graphs
|
Gagarin, Andrei
|
|
2015
|
184 |
C |
p. 146-153
8 p.
|
artikel
|
| 31 |
The worst case number of questions in Generalized AB game with and without white-peg answers
|
Jäger, Gerold
|
|
2015
|
184 |
C |
p. 20-31
12 p.
|
artikel
|
Tijdschrift beschrijving