| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
|
Lu, Changhong
|
|
|
309 |
C |
p. 147-159
|
artikel
|
| 2 |
Alphabetic points in restricted growth functions
|
Blecher, Aubrey
|
|
|
309 |
C |
p. 130-137
|
artikel
|
| 3 |
A new lower bound on graph gonality
|
Harp, Michael
|
|
|
309 |
C |
p. 172-179
|
artikel
|
| 4 |
A note on the triameter of graphs
|
Hak, Artem
|
|
|
309 |
C |
p. 278-284
|
artikel
|
| 5 |
Antimagic labeling of forests with sets of consecutive integers
|
Dhananjaya, Eranda
|
|
|
309 |
C |
p. 75-84
|
artikel
|
| 6 |
Avoidable vertices and edges in graphs: Existence, characterization, and applications
|
Beisegel, Jesse
|
|
|
309 |
C |
p. 285-300
|
artikel
|
| 7 |
Editorial Board
|
|
|
|
309 |
C |
p. ii
|
artikel
|
| 8 |
Extremal results for graphs of bounded metric dimension
|
Geneson, Jesse
|
|
|
309 |
C |
p. 123-129
|
artikel
|
| 9 |
Infinite chromatic games
|
Janczewski, Robert
|
|
|
309 |
C |
p. 138-146
|
artikel
|
| 10 |
Letter graphs and modular decomposition
|
Ferguson, Robert
|
|
|
309 |
C |
p. 215-220
|
artikel
|
| 11 |
Link dimension and exact construction of graphs from distance vectors
|
Mahindre, Gunjan S.
|
|
|
309 |
C |
p. 160-171
|
artikel
|
| 12 |
List star edge-coloring of claw-free subcubic multigraphs
|
Cui, Qing
|
|
|
309 |
C |
p. 258-264
|
artikel
|
| 13 |
Localization game for random graphs
|
Dudek, Andrzej
|
|
|
309 |
C |
p. 202-214
|
artikel
|
| 14 |
Measurement and algorithm for conditional local diagnosis of regular networks under the MM* model
|
Yuan, Jun
|
|
|
309 |
C |
p. 46-67
|
artikel
|
| 15 |
On r -hued list coloring of K 4 ( 7 ) -minor free graphs
|
Wei, Wenjuan
|
|
|
309 |
C |
p. 301-309
|
artikel
|
| 16 |
On the constructions of resilient Boolean functions with five-valued Walsh spectra and resilient semi-bent functions
|
Su, Sihong
|
|
|
309 |
C |
p. 1-12
|
artikel
|
| 17 |
On the eccentric connectivity index of uniform hypergraphs
|
Weng, Weiming
|
|
|
309 |
C |
p. 180-193
|
artikel
|
| 18 |
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
|
Kurz, Sascha
|
|
|
309 |
C |
p. 221-228
|
artikel
|
| 19 |
Overlaid species forests
|
Huber, K.T.
|
|
|
309 |
C |
p. 110-122
|
artikel
|
| 20 |
Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
|
Barbero, Stefano
|
|
|
309 |
C |
p. 13-31
|
artikel
|
| 21 |
Spanners in randomly weighted graphs: Independent edge lengths
|
Frieze, Alan
|
|
|
309 |
C |
p. 68-74
|
artikel
|
| 22 |
Strong cuts from compatibility relations for the Dial-a-Ride Problem
|
Morapitiye, Sunil
|
|
|
309 |
C |
p. 240-257
|
artikel
|
| 23 |
The 3-extra conditional diagnosability of balanced hypercubes under MM â model
|
Li, Lili
|
|
|
309 |
C |
p. 310-316
|
artikel
|
| 24 |
The minimum degree Group Steiner problem
|
Kortsarz, Guy
|
|
|
309 |
C |
p. 229-239
|
artikel
|
| 25 |
The secure domination number of Cartesian products of small graphs with paths and cycles
|
Haythorpe, Michael
|
|
|
309 |
C |
p. 32-45
|
artikel
|
| 26 |
The smallest pair of cospectral cubic graphs with different chromatic indexes
|
Yan, Zhidan
|
|
|
309 |
C |
p. 265-268
|
artikel
|
| 27 |
The Stochastic Boolean Function Evaluation problem for symmetric Boolean functions
|
Gkenosis, Dimitrios
|
|
|
309 |
C |
p. 269-277
|
artikel
|
| 28 |
Two-to-one functions from Galois extensions
|
Bartoli, Daniele
|
|
|
309 |
C |
p. 194-201
|
artikel
|
| 29 |
Values for level structures with polynomial-time algorithms, relevant coalition functions, and general considerations
|
Besner, Manfred
|
|
|
309 |
C |
p. 85-109
|
artikel
|
Tijdschrift beschrijving