nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A biased edge coloring game
|
Wang, Runze |
|
|
366 |
C |
p. 193-200 |
artikel |
2 |
A characterization of graphs with maximum cycle isolation number
|
Chen, Siyue |
|
|
366 |
C |
p. 161-175 |
artikel |
3 |
A tight lower bound on non-adaptive group testing estimation
|
Bshouty, Nader H. |
|
|
366 |
C |
p. 1-15 |
artikel |
4 |
Automorphism group of a graph related to zero-divisor graphs
|
Xu, Songnian |
|
|
366 |
C |
p. 35-43 |
artikel |
5 |
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
|
Foucaud, Florent |
|
|
366 |
C |
p. 106-119 |
artikel |
6 |
Critical ( P 5 , d a r t ) -free graphs
|
Xia, Wen |
|
|
366 |
C |
p. 44-52 |
artikel |
7 |
Cubic and quartic net-regular strongly regular signed graphs
|
Anđelić, Milica |
|
|
366 |
C |
p. 216-225 |
artikel |
8 |
Domination number, independent domination number and k -independence number in trees
|
Cui, Qing |
|
|
366 |
C |
p. 176-184 |
artikel |
9 |
Editorial Board
|
|
|
|
366 |
C |
p. ii |
artikel |
10 |
Functions that are uniquely maximized by sparse quasi-star graphs, and uniquely minimized by quasi-complete graphs
|
Apollonio, Nicola |
|
|
366 |
C |
p. 226-237 |
artikel |
11 |
General sum-connectivity index of unicyclic graphs with given maximum degree
|
Swartz, Elize |
|
|
366 |
C |
p. 238-249 |
artikel |
12 |
On a conjecture of Eǧecioǧlu and Iršič
|
Wei, Jianxin |
|
|
366 |
C |
p. 92-105 |
artikel |
13 |
On almost bipartite non-König–Egerváry graphs
|
Levit, Vadim E. |
|
|
366 |
C |
p. 127-134 |
artikel |
14 |
On 3-component domination numbers in graphs
|
Gao, Zhipeng |
|
|
366 |
C |
p. 53-62 |
artikel |
15 |
On group-valued potential differences and flows in a signed graph
|
Ren, Xiangyu |
|
|
366 |
C |
p. 185-192 |
artikel |
16 |
On the edge-connectivity of the square of a graph
|
Balbuena, Camino |
|
|
366 |
C |
p. 250-256 |
artikel |
17 |
On the number of perfect matchings of middle graphs
|
Lai, Jingchao |
|
|
366 |
C |
p. 86-91 |
artikel |
18 |
Packing two copies of a tree into a bipartite graph with restrained maximum degree
|
Li, Hui |
|
|
366 |
C |
p. 23-34 |
artikel |
19 |
Perfect out-forest problem and directed Steiner cycle packing problem
|
Sun, Yuefang |
|
|
366 |
C |
p. 201-209 |
artikel |
20 |
Positive existential definability in finite structures
|
Romov, Boris A. |
|
|
366 |
C |
p. 210-215 |
artikel |
21 |
Resonance graphs of plane bipartite graphs as daisy cubes
|
Brezovnik, Simon |
|
|
366 |
C |
p. 75-85 |
artikel |
22 |
Testing popularity in linear time via maximum matching
|
Bérczi-Kovács, Erika |
|
|
366 |
C |
p. 152-160 |
artikel |
23 |
The algorithm and complexity of secure domination in 3-dimensional box graphs
|
Wang, Cai-Xia |
|
|
366 |
C |
p. 63-74 |
artikel |
24 |
The k -general d -position problem for graphs
|
Cody, Brent |
|
|
366 |
C |
p. 135-151 |
artikel |
25 |
The Solitaire Clobber game and the correducibility of k -connected graphs
|
Fujimori, Tatsuya |
|
|
366 |
C |
p. 16-22 |
artikel |
26 |
Zero forcing of generalized hierarchical products
|
Anderson, Sarah E. |
|
|
366 |
C |
p. 120-126 |
artikel |