| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A note on coloring digraphs of large girth
|
Steiner, Raphael
|
|
|
287 |
C |
p. 62-64
|
artikel
|
| 2 |
Antimagic orientation of lobsters
|
Gao, Yuping
|
|
|
287 |
C |
p. 21-26
|
artikel
|
| 3 |
Approximation algorithm for minimum connected 3-path vertex cover
|
Liu, Pengcheng
|
|
|
287 |
C |
p. 77-84
|
artikel
|
| 4 |
A proof of a conjecture on the differential of a subcubic graph
|
Khoeilar, R.
|
|
|
287 |
C |
p. 27-39
|
artikel
|
| 5 |
Computing graph gonality is hard
|
Gijswijt, Dion
|
|
|
287 |
C |
p. 134-149
|
artikel
|
| 6 |
Connected positive influence dominating set in k-regular graph
|
Yao, Xiaopeng
|
|
|
287 |
C |
p. 65-76
|
artikel
|
| 7 |
Editorial Board
|
|
|
|
287 |
C |
p. ii
|
artikel
|
| 8 |
Fault-tolerant strong Menger (edge) connectivity of arrangement graph
|
Li, Pingshan
|
|
|
287 |
C |
p. 53-61
|
artikel
|
| 9 |
Maximizing the number of cliques in graphs with given matching number
|
Duan, Xiuzhuan
|
|
|
287 |
C |
p. 110-117
|
artikel
|
| 10 |
Maximum weighted matching with few edge crossings for 2-layered bipartite graph
|
Haraguchi, Kazuya
|
|
|
287 |
C |
p. 40-52
|
artikel
|
| 11 |
On characterizing the critical graphs for matching Ramsey numbers
|
Xu, Chuandong
|
|
|
287 |
C |
p. 15-20
|
artikel
|
| 12 |
On random multi-dimensional assignment problems
|
Frieze, Alan
|
|
|
287 |
C |
p. 1-9
|
artikel
|
| 13 |
Reliability assessment of the Cayley graph generated by trees
|
Zhao, Shu-Li
|
|
|
287 |
C |
p. 10-14
|
artikel
|
| 14 |
Some spectral inequalities for connected bipartite graphs with maximum A α -index
|
Li, Shuchao
|
|
|
287 |
C |
p. 97-109
|
artikel
|
| 15 |
The threshold dimension of a graph
|
Mol, Lucas
|
|
|
287 |
C |
p. 118-133
|
artikel
|
| 16 |
Two-dimensional closest pair problem: A closer look
|
Daescu, Ovidiu
|
|
|
287 |
C |
p. 85-96
|
artikel
|
Tijdschrift beschrijving