| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A characterization of unit interval bigraphs of open and closed intervals
|
Das, Ashok Kumar
|
|
|
342 |
C |
p. 231-243
|
artikel
|
| 2 |
An improved algorithm for finding maximum outerplanar subgraphs
|
Călinescu, Gruia
|
|
|
342 |
C |
p. 207-217
|
artikel
|
| 3 |
An interval convexity-based framework for multilevel clustering with applications to single-linkage clustering
|
Bertrand, Patrice
|
|
|
342 |
C |
p. 38-63
|
artikel
|
| 4 |
A note on median eigenvalues of subcubic graphs
|
Wang, Yuzhenni
|
|
|
342 |
C |
p. 138-141
|
artikel
|
| 5 |
A weak DP-coloring of planar graphs without 4- and 9-cycles
|
Xiao, Yang
|
|
|
342 |
C |
p. 391-397
|
artikel
|
| 6 |
Bounds on the modified second Zagreb index
|
Ali, Akbar
|
|
|
342 |
C |
p. 385-390
|
artikel
|
| 7 |
Coloring { P 2 ∪ P 3 , house } -free graphs with Δ − 1 colors
|
Chen, Rong
|
|
|
342 |
C |
p. 12-18
|
artikel
|
| 8 |
Common domination perfect graphs
|
Dettlaff, Magda
|
|
|
342 |
C |
p. 253-259
|
artikel
|
| 9 |
Commuting Eulerian operators
|
Ma, Shi-Mei
|
|
|
342 |
C |
p. 355-361
|
artikel
|
| 10 |
Disjointness graphs of segments in R 2 are almost all hamiltonian
|
Leaños, J.
|
|
|
342 |
C |
p. 168-173
|
artikel
|
| 11 |
Editorial Board
|
|
|
|
342 |
C |
p. ii
|
artikel
|
| 12 |
Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs
|
Yamazaki, Kazuaki
|
|
|
342 |
C |
p. 190-199
|
artikel
|
| 13 |
Enumerating floorplans with walls
|
Yamanaka, Katsuhisa
|
|
|
342 |
C |
p. 1-11
|
artikel
|
| 14 |
Erdös–Gallai-type problems for distance-edge-monitoring numbers
|
Ji, Zhen
|
|
|
342 |
C |
p. 275-285
|
artikel
|
| 15 |
Existence of paths with t blocks in k ( t ) -chromatic digraph
|
El Joubbeh, Mouhamad
|
|
|
342 |
C |
p. 381-384
|
artikel
|
| 16 |
Extremal polygonal chains with respect to the Kirchhoff index
|
Ma, Qi
|
|
|
342 |
C |
p. 218-226
|
artikel
|
| 17 |
Extremal vertex-degree function index with given order and dissociation number
|
Huang, Jing
|
|
|
342 |
C |
p. 142-152
|
artikel
|
| 18 |
Flow resistance to resistance ratios in cubic graphs
|
Allie, Imran
|
|
|
342 |
C |
p. 362-367
|
artikel
|
| 19 |
Generalized fault-tolerance for enhanced hypercubes
|
Ma, Meijie
|
|
|
342 |
C |
p. 244-252
|
artikel
|
| 20 |
Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing
|
De Agostino, Sergio
|
|
|
342 |
C |
p. 200-206
|
artikel
|
| 21 |
Group distance magic labeling of tetravalent circulant graphs
|
Deng, Guixin
|
|
|
342 |
C |
p. 19-26
|
artikel
|
| 22 |
Minimal spread of integral circulant graphs
|
Bašić, Milan
|
|
|
342 |
C |
p. 317-333
|
artikel
|
| 23 |
Non-trivial t -intersecting separated families
|
Frankl, Peter
|
|
|
342 |
C |
p. 124-137
|
artikel
|
| 24 |
Odd-sum colorings of planar graphs
|
Cranston, Daniel W.
|
|
|
342 |
C |
p. 82-88
|
artikel
|
| 25 |
On defect restricted matching extension graphs
|
Gan, Zhiyong
|
|
|
342 |
C |
p. 76-81
|
artikel
|
| 26 |
On spectral extrema of graphs with given order and dissociation number
|
Huang, Jing
|
|
|
342 |
C |
p. 368-380
|
artikel
|
| 27 |
On structural parameterizations of load coloring
|
Reddy, I. Vinod
|
|
|
342 |
C |
p. 181-189
|
artikel
|
| 28 |
On the chromatic number of graphs of odd girth without longer odd holes
|
Wang, Hongyang
|
|
|
342 |
C |
p. 227-230
|
artikel
|
| 29 |
On the connectivity and the diameter of betweenness-uniform graphs
|
Hartman, David
|
|
|
342 |
C |
p. 27-37
|
artikel
|
| 30 |
On the distance-edge-monitoring numbers of graphs
|
Yang, Chenxu
|
|
|
342 |
C |
p. 153-167
|
artikel
|
| 31 |
On the skewness of products of graphs
|
Chia, Gek L.
|
|
|
342 |
C |
p. 295-303
|
artikel
|
| 32 |
Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
|
Tangjai, Wipawee
|
|
|
342 |
C |
p. 347-354
|
artikel
|
| 33 |
Planar Turán number of the disjoint union of cycles
|
Li, Ping
|
|
|
342 |
C |
p. 260-274
|
artikel
|
| 34 |
Priority-based bin packing with subset constraints
|
Wojciechowski, Piotr
|
|
|
342 |
C |
p. 64-75
|
artikel
|
| 35 |
Radio number for the Cartesian product of two trees
|
Bantva, Devsi
|
|
|
342 |
C |
p. 304-316
|
artikel
|
| 36 |
Shortest distances as enumeration problem
|
Casel, Katrin
|
|
|
342 |
C |
p. 89-103
|
artikel
|
| 37 |
Some extremal problems on A α -spectral radius of graphs with given size
|
Ye, Aiyun
|
|
|
342 |
C |
p. 286-294
|
artikel
|
| 38 |
Strengthening Brooks’ chromatic bound on P 6 -free graphs
|
Gupta, Uttam K.
|
|
|
342 |
C |
p. 334-346
|
artikel
|
| 39 |
The change of Seidel energy of 5-partite Turán graph due to edge deletion
|
Liu, Yayang
|
|
|
342 |
C |
p. 104-123
|
artikel
|
| 40 |
Treewidth of the q -Kneser graphs
|
Cao, Mengyu
|
|
|
342 |
C |
p. 174-180
|
artikel
|
Tijdschrift beschrijving