| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An ( F 3 , F 4 ) -partition of planar graphs without 4- and 6-cycles
|
Hu, Kaiyang
|
|
|
373 |
C |
p. 1-9
|
artikel
|
| 2 |
An ordering theorem on the Q -spectral radius of graphs with given size and its applications
|
Guo, Shu-Guang
|
|
|
373 |
C |
p. 91-98
|
artikel
|
| 3 |
Approximation algorithm for prize-collecting weighted set cover with fairness constraints
|
Zhou, Mingchao
|
|
|
373 |
C |
p. 301-315
|
artikel
|
| 4 |
Comparing the p -independence number of regular graphs to the q -independence number of their line graphs
|
Caro, Yair
|
|
|
373 |
C |
p. 316-326
|
artikel
|
| 5 |
Compositions of digraphs: a survey
|
Sun, Yuefang
|
|
|
373 |
C |
p. 137-153
|
artikel
|
| 6 |
Conditional matroidal edge connectivity of Cayley graphs
|
Wang, Li
|
|
|
373 |
C |
p. 271-278
|
artikel
|
| 7 |
Cops and attacking robbers with cycle constraints
|
Clow, Alexander
|
|
|
373 |
C |
p. 327-342
|
artikel
|
| 8 |
Edge addition and the change in Kemeny’s constant
|
Kirkland, Stephen
|
|
|
373 |
C |
p. 77-90
|
artikel
|
| 9 |
Editorial Board
|
|
|
|
373 |
C |
p. ii
|
artikel
|
| 10 |
Exploring graphs with distinct M -eigenvalues: Product operation, Wronskian vertices, and controllability
|
Shan, Haiying
|
|
|
373 |
C |
p. 125-136
|
artikel
|
| 11 |
Extremal results on the spectral radius of function-weighted adjacency matrices
|
Li, Xueliang
|
|
|
373 |
C |
p. 204-216
|
artikel
|
| 12 |
Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs
|
Yamada, Suguru
|
|
|
373 |
C |
p. 343-354
|
artikel
|
| 13 |
Forbidden pairs for 2-factorable and hamiltonian graphs under the necessary condition
|
Wang, Qiang
|
|
|
373 |
C |
p. 290-300
|
artikel
|
| 14 |
Higher order matching preclusion for regular interconnection networks
|
Cheng, Eddie
|
|
|
373 |
C |
p. 107-124
|
artikel
|
| 15 |
Information dissemination and confusion in signed networks
|
Jin, Ligang
|
|
|
373 |
C |
p. 99-106
|
artikel
|
| 16 |
Nordhaus–Gaddum-type results for monitoring edge-geodetic number of graphs
|
Zhang, Yingying
|
|
|
373 |
C |
p. 39-52
|
artikel
|
| 17 |
On cubic rainbow domination regular graphs
|
Kuzman, Boštjan
|
|
|
373 |
C |
p. 26-38
|
artikel
|
| 18 |
On proper conflict-free colorings of IC-planar graphs
|
Wu, Yali
|
|
|
373 |
C |
p. 217-223
|
artikel
|
| 19 |
On the N th 2-adic complexity of binary sequences identified with algebraic 2-adic integers
|
Chen, Zhixiong
|
|
|
373 |
C |
p. 279-289
|
artikel
|
| 20 |
On the unimodality of Zhang-Zhang polynomials of parallelogram chains
|
Li, Guanru
|
|
|
373 |
C |
p. 224-230
|
artikel
|
| 21 |
Optimization tools for computing colorings of [ 1 , … , n ] with few monochromatic solutions on 3-variable linear equations
|
De Loera, Jesús A.
|
|
|
373 |
C |
p. 159-178
|
artikel
|
| 22 |
Partitioning vertices of graphs into paths of the same length
|
Duginov, Oleg
|
|
|
373 |
C |
p. 179-195
|
artikel
|
| 23 |
Perfect matchings of ( 4 , 6 ) -fullerenes with largest forcing number
|
Zhang, Yaxian
|
|
|
373 |
C |
p. 10-25
|
artikel
|
| 24 |
Queue layouts on folded hypercubes
|
Geng, Xin
|
|
|
373 |
C |
p. 154-158
|
artikel
|
| 25 |
r -dynamic colorings and the spectral radius in graphs
|
Ai, Jiangdong
|
|
|
373 |
C |
p. 249-255
|
artikel
|
| 26 |
Relation between the H-rank of a mixed graph and the girth of its underlying graph
|
Khan, Suliman
|
|
|
373 |
C |
p. 239-248
|
artikel
|
| 27 |
Several classes of minimal linear codes from weakly regular and non-weakly regular bent functions
|
Jin, Wengang
|
|
|
373 |
C |
p. 53-76
|
artikel
|
| 28 |
Some results on ( 1 , 2 ) -rainbow connection number
|
Ma, Yingbin
|
|
|
373 |
C |
p. 231-238
|
artikel
|
| 29 |
The number of dissociation sets in connected graphs
|
Yuan, Bo-Jun
|
|
|
373 |
C |
p. 196-203
|
artikel
|
| 30 |
Use of simple arithmetic operations to construct efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks
|
Carlet, Claude
|
|
|
373 |
C |
p. 256-270
|
artikel
|
Tijdschrift beschrijving