| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Addible edges in 2-matching-connected graphs and 3-matching-connected graphs
|
Li, Hengzhe
|
|
|
357 |
C |
p. 274-281
|
artikel
|
| 2 |
A lower bound for secure domination number of an outerplanar graph
|
Araki, Toru
|
|
|
357 |
C |
p. 81-85
|
artikel
|
| 3 |
A note on Alon–Tarsi number of Halin graphs
|
Lin, Dazhi
|
|
|
357 |
C |
p. 297-299
|
artikel
|
| 4 |
Approximate envy-freeness in graphical cake cutting
|
Yuen, Sheung Man
|
|
|
357 |
C |
p. 112-131
|
artikel
|
| 5 |
A probabilistic algorithm for bounding the total restrained domination number of a K 1 , ℓ -free graph
|
Joubert, Ernst J.
|
|
|
357 |
C |
p. 429-439
|
artikel
|
| 6 |
A quasi-quadratic vertex-kernel for Cograph Edge Editing
|
Crespelle, Christophe
|
|
|
357 |
C |
p. 282-296
|
artikel
|
| 7 |
A stability result for Berge- K 3 , t r -graphs and its applications
|
Zhou, Junpeng
|
|
|
357 |
C |
p. 331-342
|
artikel
|
| 8 |
Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number
|
Yang, Xiuwen
|
|
|
357 |
C |
p. 241-257
|
artikel
|
| 9 |
Complete forcing numbers of (4,6)-fullerenes
|
He, Xin
|
|
|
357 |
C |
p. 385-398
|
artikel
|
| 10 |
Connectivity of random hypergraphs with a given hyperedge size distribution
|
Bergman, Elmer
|
|
|
357 |
C |
p. 1-13
|
artikel
|
| 11 |
Constructing cospectral graphs by unfolding non-bipartite graphs
|
Kannan, M. Rajesh
|
|
|
357 |
C |
p. 264-273
|
artikel
|
| 12 |
Construction and enumeration of balanced rotation symmetric Boolean functions
|
A.U., Zeenath
|
|
|
357 |
C |
p. 197-208
|
artikel
|
| 13 |
Editorial Board
|
|
|
|
357 |
C |
p. ii
|
artikel
|
| 14 |
Effects of edge addition or removal on the nullity of a graph
|
Batal, Ahmet
|
|
|
357 |
C |
p. 56-65
|
artikel
|
| 15 |
Hamiltonicity of covering graphs of trees
|
Bradshaw, Peter
|
|
|
357 |
C |
p. 449-464
|
artikel
|
| 16 |
Improper odd coloring of IC-planar graphs
|
Chen, Ping
|
|
|
357 |
C |
p. 74-80
|
artikel
|
| 17 |
Independent domination in the graph defined by two consecutive levels of the n -cube
|
Kalinowski, Thomas
|
|
|
357 |
C |
p. 161-172
|
artikel
|
| 18 |
Independent domination versus packing in subcubic graphs
|
Cho, Eun-Kyung
|
|
|
357 |
C |
p. 132-134
|
artikel
|
| 19 |
Kempe classes and almost bipartite graphs
|
Cranston, Daniel W.
|
|
|
357 |
C |
p. 94-98
|
artikel
|
| 20 |
k -isolation in graphs
|
Zhang, Gang
|
|
|
357 |
C |
p. 99-111
|
artikel
|
| 21 |
On extremal factors of de Bruijn-like graphs
|
Álvarez, Nicolás
|
|
|
357 |
C |
p. 352-364
|
artikel
|
| 22 |
On rainbow domination of generalized Petersen graphs P ( c k , k )
|
Žerovnik, Janez
|
|
|
357 |
C |
p. 440-448
|
artikel
|
| 23 |
Perfect codes in 2-valent Cayley digraphs on abelian groups
|
Yu, Shilong
|
|
|
357 |
C |
p. 236-240
|
artikel
|
| 24 |
Polynomial-delay generation of functional digraphs up to isomorphism
|
Defrain, Oscar
|
|
|
357 |
C |
p. 24-33
|
artikel
|
| 25 |
PTASs for secure dominating set in planar graphs and growth-bounded graphs
|
Li, Ke
|
|
|
357 |
C |
p. 343-351
|
artikel
|
| 26 |
Regular sets in circulant graphs with degree 3
|
Hao, Yu-Xia
|
|
|
357 |
C |
p. 51-55
|
artikel
|
| 27 |
Restricted optimal pebbling is NP-hard
|
Papp, László F.
|
|
|
357 |
C |
p. 258-263
|
artikel
|
| 28 |
Saturation numbers of joins of graphs
|
Hu, Sinan
|
|
|
357 |
C |
p. 300-309
|
artikel
|
| 29 |
Shortest odd paths in undirected graphs with conservative weight functions
|
Jüttner, Alpár
|
|
|
357 |
C |
p. 34-50
|
artikel
|
| 30 |
Some new results concerning power graphs and enhanced power graphs of groups
|
Bošnjak, Ivica
|
|
|
357 |
C |
p. 86-93
|
artikel
|
| 31 |
Structure of some ( P 7 , C 4 )-free graphs with application to colorings
|
Chen, Ran
|
|
|
357 |
C |
p. 14-23
|
artikel
|
| 32 |
The diagnosability of interconnection networks
|
Wang, Mujiangshan
|
|
|
357 |
C |
p. 413-428
|
artikel
|
| 33 |
The edge fault-tolerance about the strong Menger edge-connectivity of order r among hamming graph
|
Zhang, Mingzu
|
|
|
357 |
C |
p. 322-330
|
artikel
|
| 34 |
The gap between the rank of a complex unit gain graph and its underlying graph
|
Du, Kexin
|
|
|
357 |
C |
p. 399-412
|
artikel
|
| 35 |
The high order spectral extremal results for graphs and their applications
|
Liu, Chunmeng
|
|
|
357 |
C |
p. 209-214
|
artikel
|
| 36 |
The one-station bike repositioning problem
|
Angelelli, E.
|
|
|
357 |
C |
p. 173-196
|
artikel
|
| 37 |
The 3-path-connectivity of the star graphs
|
Li, Lin
|
|
|
357 |
C |
p. 215-235
|
artikel
|
| 38 |
The weight balance function on trees
|
McMorris, F.R.
|
|
|
357 |
C |
p. 66-73
|
artikel
|
| 39 |
Tilted inequalities and facets of the set covering polytope: A theoretical analysis
|
Lamothe, François
|
|
|
357 |
C |
p. 143-160
|
artikel
|
| 40 |
Transit functions and pyramid-like binary clustering systems
|
Changat, Manoj
|
|
|
357 |
C |
p. 365-384
|
artikel
|
| 41 |
Triangle-free signed graphs with small negative inertia index
|
Duan, Fang
|
|
|
357 |
C |
p. 135-142
|
artikel
|
| 42 |
Word-representability of graphs with respect to split recomposition
|
Dwary, Tithi
|
|
|
357 |
C |
p. 310-321
|
artikel
|
Tijdschrift beschrijving