| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A characterization of 4- χ S -vertex-critical graphs for packing sequences with s 1 = 1 and s 2 ≥ 3
|
Klavžar, Sandi
|
|
|
338 |
C |
p. 46-55
|
artikel
|
| 2 |
Algorithms for computing the Folk rule in minimum cost spanning tree problems with groups
|
Lorenzo-Freire, S.
|
|
|
338 |
C |
p. 113-124
|
artikel
|
| 3 |
A linear-time algorithm for semitotal domination in strongly chordal graphs
|
Tripathi, Vikash
|
|
|
338 |
C |
p. 77-88
|
artikel
|
| 4 |
A local search approximation algorithm for the multiway cut problem
|
Bloch-Hansen, Andrew
|
|
|
338 |
C |
p. 8-21
|
artikel
|
| 5 |
Approximation algorithms for orthogonal line centers
|
Das, Arun Kumar
|
|
|
338 |
C |
p. 69-76
|
artikel
|
| 6 |
Characterization of expansion-related properties of modular graphs
|
Shang, Yilun
|
|
|
338 |
C |
p. 135-144
|
artikel
|
| 7 |
Complete characterizations of the 2-domination and P 3 -hull number polytopes
|
Blaum, Manuela
|
|
|
338 |
C |
p. 30-45
|
artikel
|
| 8 |
3D geo-graphs: Efficient flip verification for the spherical zoning problem
|
Ludden, Ian G.
|
|
|
338 |
C |
p. 329-346
|
artikel
|
| 9 |
Digraphs whose m -step competition graphs are trees
|
Choi, Myungho
|
|
|
338 |
C |
p. 234-246
|
artikel
|
| 10 |
Edge coloring of graphs of signed class 1 and 2
|
Janczewski, Robert
|
|
|
338 |
C |
p. 311-319
|
artikel
|
| 11 |
Editorial Board
|
|
|
|
338 |
C |
p. ii
|
artikel
|
| 12 |
Fractional matching preclusion numbers of Cartesian product graphs
|
Luan, Yu
|
|
|
338 |
C |
p. 100-112
|
artikel
|
| 13 |
2-limited broadcast domination on grid graphs
|
Slobodin, Aaron
|
|
|
338 |
C |
p. 158-178
|
artikel
|
| 14 |
Minimum consistent subset of simple graph classes
|
Dey, Sanjana
|
|
|
338 |
C |
p. 255-277
|
artikel
|
| 15 |
More results on the z -chromatic number of graphs
|
Khaleghi, Abbas
|
|
|
338 |
C |
p. 89-99
|
artikel
|
| 16 |
On exponential type sequences
|
Xue, Fang-Gang
|
|
|
338 |
C |
p. 187-189
|
artikel
|
| 17 |
On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs
|
Sun, Wenwen
|
|
|
338 |
C |
p. 179-186
|
artikel
|
| 18 |
Partially unate Boolean functions: Properties of their sum-of-products representations
|
Damiani, Maurizio
|
|
|
338 |
C |
p. 278-292
|
artikel
|
| 19 |
Partitioning P 4 -tidy graphs into a stable set and a forest
|
Bravo, Raquel
|
|
|
338 |
C |
p. 22-29
|
artikel
|
| 20 |
Separating signatures in signed planar graphs
|
Naserasr, Reza
|
|
|
338 |
C |
p. 302-310
|
artikel
|
| 21 |
Strong incidence coloring of outerplanar graphs
|
Mousavi, Fatemeh Sadat
|
|
|
338 |
C |
p. 293-301
|
artikel
|
| 22 |
Target set selection with maximum activation time
|
Keiler, Lucas
|
|
|
338 |
C |
p. 199-217
|
artikel
|
| 23 |
The boundary of a graph and its isoperimetric inequality
|
Steinerberger, Stefan
|
|
|
338 |
C |
p. 125-134
|
artikel
|
| 24 |
The linear 2-arboricity of IC-planar graphs
|
Liu, Juan
|
|
|
338 |
C |
p. 1-7
|
artikel
|
| 25 |
The localization game on oriented graphs
|
Bonato, Anthony
|
|
|
338 |
C |
p. 145-157
|
artikel
|
| 26 |
The LPT heuristic for minimizing total load on a proportionate openshop
|
Gerstl, Enrique
|
|
|
338 |
C |
p. 190-198
|
artikel
|
| 27 |
The maximum matching extendability and factor-criticality of 1-planar graphs
|
Zhang, Jiangyue
|
|
|
338 |
C |
p. 247-254
|
artikel
|
| 28 |
The statistical analysis for Sombor indices in a random polygonal chain networks
|
Liu, Jia-Bao
|
|
|
338 |
C |
p. 218-233
|
artikel
|
| 29 |
Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs
|
Zhang, Hui
|
|
|
338 |
C |
p. 320-328
|
artikel
|
| 30 |
Wiener index and vulnerability parameters of graphs
|
Yatauro, Michael
|
|
|
338 |
C |
p. 56-68
|
artikel
|
Tijdschrift beschrijving