| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A class of graphs that complementation makes infinitely many Cohen–Macaulay members
|
Ashitha, T.
|
|
|
364 |
C |
p. 189-198
|
artikel
|
| 2 |
A lower bound on the constant in the Fourier min-entropy/influence conjecture
|
Biswas, Aniruddha
|
|
|
364 |
C |
p. 23-32
|
artikel
|
| 3 |
A new perspective from hypertournaments to tournaments
|
Ai, Jiangdong
|
|
|
364 |
C |
p. 136-142
|
artikel
|
| 4 |
χ -boundedness and related problems on graphs without long induced paths: A survey
|
Char, Arnab
|
|
|
364 |
C |
p. 99-119
|
artikel
|
| 5 |
Counting the minimum number of arcs in an oriented graph having weak diameter 2
|
Das, Sandip
|
|
|
364 |
C |
p. 222-236
|
artikel
|
| 6 |
Distinguishing graphs via cycles
|
Klobas, Nina
|
|
|
364 |
C |
p. 74-98
|
artikel
|
| 7 |
Dual bounded generation: Polynomial, second-order cone and positive semidefinite matrix inequalities
|
Elbassioni, Khaled
|
|
|
364 |
C |
p. 173-188
|
artikel
|
| 8 |
Editorial Board
|
|
|
|
364 |
C |
p. ii
|
artikel
|
| 9 |
Exploring algorithmic solutions for the Independent Roman Domination problem in graphs
|
Paul, Kaustav
|
|
|
364 |
C |
p. 143-152
|
artikel
|
| 10 |
Facial matchings in plane graphs
|
Czap, Július
|
|
|
364 |
C |
p. 16-22
|
artikel
|
| 11 |
Fast computation of linear approximation of general word-oriented composite function
|
Ma, Sudong
|
|
|
364 |
C |
p. 157-172
|
artikel
|
| 12 |
Further acceleration in computing the gap greedy spanner: An empirical approach
|
Salami, Hosein
|
|
|
364 |
C |
p. 33-52
|
artikel
|
| 13 |
Leveraging duality for the gamma-robust segment routing traffic engineering problem
|
Callebaut, Hugo
|
|
|
364 |
C |
p. 199-212
|
artikel
|
| 14 |
Non-inclusive diagnosability of folded hypercube-like networks
|
Zhuo, Nengjin
|
|
|
364 |
C |
p. 237-246
|
artikel
|
| 15 |
On saturated non-covered graphs
|
Zhou, Jinqiu
|
|
|
364 |
C |
p. 53-59
|
artikel
|
| 16 |
On the generalized Turán number of star forests
|
Liu, Yan-Jiao
|
|
|
364 |
C |
p. 213-221
|
artikel
|
| 17 |
On the hardness of problems around s -clubs on split graphs
|
Bazgan, Cristina
|
|
|
364 |
C |
p. 247-254
|
artikel
|
| 18 |
On the maximum diversity of hypergraphs with fixed matching number
|
Frankl, Peter
|
|
|
364 |
C |
p. 120-135
|
artikel
|
| 19 |
The combinatorics of Motzkin polyominoes
|
Baril, Jean-Luc
|
|
|
364 |
C |
p. 1-15
|
artikel
|
| 20 |
The cyclic diagnosability of star graphs under the PMC and MM* models
|
Mei, Liu
|
|
|
364 |
C |
p. 60-73
|
artikel
|
| 21 |
Thin edges in the subgraph induced by noncubic vertices of a brace
|
He, Xiaoling
|
|
|
364 |
C |
p. 153-156
|
artikel
|
Tijdschrift beschrijving