| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An improvement to Chvátal and Thomassen’s upper bound for oriented diameter
|
Babu, Jasine
|
|
|
304 |
C |
p. 432-440
|
artikel
|
| 2 |
A note on connected greedy edge colouring
|
Bonamy, Marthe
|
|
|
304 |
C |
p. 129-136
|
artikel
|
| 3 |
A note on the orientation covering number
|
Janzer, Barnabás
|
|
|
304 |
C |
p. 349-351
|
artikel
|
| 4 |
A note on Topological indices and coindices of disjunction and symmetric difference of graphs
|
Alameri, Abdu
|
|
|
304 |
C |
p. 230-235
|
artikel
|
| 5 |
Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions
|
Gu, Mei-Mei
|
|
|
304 |
C |
p. 137-152
|
artikel
|
| 6 |
Corrigendum to “The lower bound of the weightwise nonlinearity profile of a class of weightwise perfectly balanced functions” [Discrete Appl. Math. 297 (2021) 60–70]
|
Su, Sihong
|
|
|
304 |
C |
p. 323
|
artikel
|
| 7 |
Covering Italian domination in graphs
|
Khodkar, Abdollah
|
|
|
304 |
C |
p. 324-331
|
artikel
|
| 8 |
Distance-constrained labellings of Cartesian products of graphs
|
Lladó, Anna
|
|
|
304 |
C |
p. 375-383
|
artikel
|
| 9 |
Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
|
Nakamura, Satoshi
|
|
|
304 |
C |
p. 220-229
|
artikel
|
| 10 |
Editorial Board
|
|
|
|
304 |
C |
p. ii
|
artikel
|
| 11 |
Extreme Wiener indices of trees with given number of vertices of maximum degree
|
Božović, Vladimir
|
|
|
304 |
C |
p. 23-31
|
artikel
|
| 12 |
Gallai–Ramsey numbers for graphs with chromatic number three
|
Zhao, Qinghong
|
|
|
304 |
C |
p. 110-118
|
artikel
|
| 13 |
Hardness and efficiency on t -admissibility for graph operations
|
Couto, Fernanda
|
|
|
304 |
C |
p. 342-348
|
artikel
|
| 14 |
Investigations on c -boomerang uniformity and perfect nonlinearity
|
Stănică, Pantelimon
|
|
|
304 |
C |
p. 297-314
|
artikel
|
| 15 |
K 1 , 2 -isolation in graphs
|
Zhang, Gang
|
|
|
304 |
C |
p. 365-374
|
artikel
|
| 16 |
Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
|
Henning, Michael A.
|
|
|
304 |
C |
p. 12-22
|
artikel
|
| 17 |
Matching and spanning trails in digraphs
|
Liu, Juan
|
|
|
304 |
C |
p. 417-431
|
artikel
|
| 18 |
Metric k -median clustering in insertion-only streams
|
Braverman, Vladimir
|
|
|
304 |
C |
p. 164-180
|
artikel
|
| 19 |
Nonempty intersection of longest paths in graphs without forbidden pairs
|
Gao, Yuping
|
|
|
304 |
C |
p. 76-83
|
artikel
|
| 20 |
On highly palindromic words: The n -ary case
|
Ago, Kristina
|
|
|
304 |
C |
p. 98-109
|
artikel
|
| 21 |
On the average Steiner 3-eccentricity of trees
|
Li, Xingfu
|
|
|
304 |
C |
p. 181-195
|
artikel
|
| 22 |
On the information ratio of graphs without high-degree neighbors
|
Gyarmati, Máté
|
|
|
304 |
C |
p. 55-62
|
artikel
|
| 23 |
On the number of alternating paths in random graphs
|
Bennett, Patrick
|
|
|
304 |
C |
p. 84-97
|
artikel
|
| 24 |
On the security number of the Cartesian product of graphs
|
Jakovac, Marko
|
|
|
304 |
C |
p. 119-128
|
artikel
|
| 25 |
Parameterized algorithms for the Happy Set problem
|
Asahiro, Yuichi
|
|
|
304 |
C |
p. 32-44
|
artikel
|
| 26 |
Pattern-avoiding ( 0 , 1 ) -matrices and bases of permutation matrices
|
Brualdi, Richard A.
|
|
|
304 |
C |
p. 196-211
|
artikel
|
| 27 |
Perfect matching and distance spectral radius in graphs and bipartite graphs
|
Zhang, Yuke
|
|
|
304 |
C |
p. 315-322
|
artikel
|
| 28 |
Planar graphs without 4-cycles and intersecting triangles are ( 1 , 1 , 0 ) -colorable
|
Li, Xiangwen
|
|
|
304 |
C |
p. 236-247
|
artikel
|
| 29 |
Recursive MDS matrices over finite commutative rings
|
Kesarwani, Abhishek
|
|
|
304 |
C |
p. 384-396
|
artikel
|
| 30 |
Restricted domination in Quasi-transitive and 3-Quasi-transitive digraphs
|
López-Ortiz, Marco Antonio
|
|
|
304 |
C |
p. 352-364
|
artikel
|
| 31 |
Second-order productivity, second-order payoffs, and the Shapley value
|
Casajus, André
|
|
|
304 |
C |
p. 212-219
|
artikel
|
| 32 |
Seymour’s second neighborhood conjecture for m -free, k -transitive, k -anti-transitive digraphs and some approaches
|
Daamouch, Moussa
|
|
|
304 |
C |
p. 332-341
|
artikel
|
| 33 |
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
|
Bermudo, Sergio
|
|
|
304 |
C |
p. 153-163
|
artikel
|
| 34 |
The (degree-) Kirchhoff indices in random polygonal chains
|
Li, Jiajian
|
|
|
304 |
C |
p. 63-75
|
artikel
|
| 35 |
The 1-good neighbor connectivity of unidirectional star graph networks
|
Li, Chunfang
|
|
|
304 |
C |
p. 1-11
|
artikel
|
| 36 |
The number of subtrees in graphs with given number of cut edges
|
Xu, Kexiang
|
|
|
304 |
C |
p. 283-296
|
artikel
|
| 37 |
The structure of 2-colored best match graphs
|
Korchmaros, Annachiara
|
|
|
304 |
C |
p. 397-416
|
artikel
|
| 38 |
Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines
|
Chen, Rubing
|
|
|
304 |
C |
p. 45-54
|
artikel
|
| 39 |
Upper bounds for stabbing simplices by a line
|
Daum-Sadon, Inbar
|
|
|
304 |
C |
p. 248-259
|
artikel
|
| 40 |
Weighted total acquisition
|
Bagan, Guillaume
|
|
|
304 |
C |
p. 260-282
|
artikel
|
Tijdschrift beschrijving