| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Coloring k -partite sparse digraphs
|
Harutyunyan, Ararat
|
|
|
353 |
C |
p. 1-3
|
artikel
|
| 2 |
Conditional k -matching preclusion for n -dimensional torus networks
|
Hu, Xiaomin
|
|
|
353 |
C |
p. 181-190
|
artikel
|
| 3 |
Corrigendum to “An algorithm to find maximum area polygons circumscribed about a convex polygon” [Discrete Appl. Math. 255 (2019) 98–108]
|
Ausserhofer, Markus
|
|
|
353 |
C |
p. 222-226
|
artikel
|
| 4 |
Editorial Board
|
|
|
|
353 |
C |
p. ii
|
artikel
|
| 5 |
Full degree spanning trees in random regular graphs
|
Acquaviva, Sarah
|
|
|
353 |
C |
p. 85-93
|
artikel
|
| 6 |
Further results on random walk labelings
|
Fried, Sela
|
|
|
353 |
C |
p. 211-221
|
artikel
|
| 7 |
Gated independence in graphs
|
Civan, Yusuf
|
|
|
353 |
C |
p. 121-138
|
artikel
|
| 8 |
On a class of m -to-1 functions
|
Ding, Zhiguo
|
|
|
353 |
C |
p. 208-210
|
artikel
|
| 9 |
On claw-free graphs with all but four eigenvalues equal to 0 or − 1
|
Sun, Shaowei
|
|
|
353 |
C |
p. 71-84
|
artikel
|
| 10 |
On individual leaf depths of trees
|
Elizalde, Sergi
|
|
|
353 |
C |
p. 151-180
|
artikel
|
| 11 |
On the general position number of Mycielskian graphs
|
Thomas, Elias John
|
|
|
353 |
C |
p. 29-43
|
artikel
|
| 12 |
On the unicyclic graphs having vertices that belong to all their (strong) metric bases
|
Hakanen, Anni
|
|
|
353 |
C |
p. 191-207
|
artikel
|
| 13 |
Polynomial-time equivalences and refined algorithms for longest common subsequence variants
|
Asahiro, Yuichi
|
|
|
353 |
C |
p. 44-64
|
artikel
|
| 14 |
Proximity and remoteness in graphs: A survey
|
Aouchiche, Mustapha
|
|
|
353 |
C |
p. 94-120
|
artikel
|
| 15 |
Secure total domination number in maximal outerplanar graphs
|
Aita, Yasufumi
|
|
|
353 |
C |
p. 65-70
|
artikel
|
| 16 |
Spreading in graphs
|
Brešar, Boštjan
|
|
|
353 |
C |
p. 139-150
|
artikel
|
| 17 |
Square coloring of planar graphs with maximum degree at most five
|
Zou, Jiani
|
|
|
353 |
C |
p. 4-11
|
artikel
|
| 18 |
The constrained Bottleneck Spanning Tree Problem with upgrades
|
Coulier, Bryan
|
|
|
353 |
C |
p. 12-28
|
artikel
|
Tijdschrift beschrijving