| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A note on the independence number, connectivity and
k
-ended tree
|
Ha, Pham Hoang
|
|
|
305 |
C |
p. 142-144
|
artikel
|
| 2 |
A parity theorem about trees with specified degrees
|
Cameron, Kathie
|
|
|
305 |
C |
p. 48-55
|
artikel
|
| 3 |
A simplified algorithm computing all
s
-
t
bridges and articulation points
|
Cairo, Massimo
|
|
|
305 |
C |
p. 103-108
|
artikel
|
| 4 |
Axiomatizing the Public Good Index via merging and new arrival properties
|
Safokem, Adin
|
|
|
305 |
C |
p. 86-102
|
artikel
|
| 5 |
Balanced flows for transshipment problems
|
Gurvich, Vladimir
|
|
|
305 |
C |
p. 214-220
|
artikel
|
| 6 |
Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees
|
Goubko, Mikhail
|
|
|
305 |
C |
p. 1-9
|
artikel
|
| 7 |
Binding numbers and restricted fractional
(
g
,
f
)
-factors in graphs
|
Zhou, Sizhong
|
|
|
305 |
C |
p. 350-356
|
artikel
|
| 8 |
Bounded-degree light approximate shortest-path trees in doubling metrics
|
Gudmundsson, Joachim
|
|
|
305 |
C |
p. 199-204
|
artikel
|
| 9 |
Editorial Board
|
|
|
|
305 |
C |
p. ii
|
artikel
|
| 10 |
Effective resistances and spanning trees in the complete bipartite graph plus a matching
|
Ge, Jun
|
|
|
305 |
C |
p. 145-153
|
artikel
|
| 11 |
Finding densest
k
-connected subgraphs
|
Bonchi, Francesco
|
|
|
305 |
C |
p. 34-47
|
artikel
|
| 12 |
Firefighting on the hexagonal grid
|
Dean, Abdullah
|
|
|
305 |
C |
p. 16-22
|
artikel
|
| 13 |
Improper interval edge colorings of graphs
|
Casselgren, Carl Johan
|
|
|
305 |
C |
p. 164-178
|
artikel
|
| 14 |
Line segment disk cover
|
Basappa, Manjanna
|
|
|
305 |
C |
p. 261-271
|
artikel
|
| 15 |
Local WL invariance and hidden shades of regularity
|
Fuhlbrück, Frank
|
|
|
305 |
C |
p. 191-198
|
artikel
|
| 16 |
Maximum induced forests in random graphs
|
Krivoshapko, M.
|
|
|
305 |
C |
p. 211-213
|
artikel
|
| 17 |
New comments on “A Hamilton sufficient condition for completely independent spanning tree”
|
Li, Junjiang
|
|
|
305 |
C |
p. 10-15
|
artikel
|
| 18 |
On Ramsey and star-critical Ramsey numbers for generalized fans versus
n
K
m
|
Hamm, Arran
|
|
|
305 |
C |
p. 64-70
|
artikel
|
| 19 |
On the characterization of some algebraically defined bipartite graphs of girth eight
|
Xu, Ming
|
|
|
305 |
C |
p. 221-232
|
artikel
|
| 20 |
On the (signless Laplacian) spectral radius of minimally
k
-(edge)-connected graphs for small
k
|
Fan, Dandan
|
|
|
305 |
C |
p. 154-163
|
artikel
|
| 21 |
On the tractability of
(
k
,
i
)
-coloring
|
Bhyravarapu, Sriram
|
|
|
305 |
C |
p. 329-339
|
artikel
|
| 22 |
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
|
Wojciechowski, Piotr
|
|
|
305 |
C |
p. 272-294
|
artikel
|
| 23 |
Preface: CALDAM 2018
|
Panda, Bhawani Sankar
|
|
|
305 |
C |
p. 260
|
artikel
|
| 24 |
Probabilistic properties of highly connected random geometric graphs
|
Manthey, Bodo
|
|
|
305 |
C |
p. 366-376
|
artikel
|
| 25 |
Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions
|
Das, Sandip
|
|
|
305 |
C |
p. 311-328
|
artikel
|
| 26 |
Reconstruction number of graphs with unique pendant vertex
|
Monikandan, S.
|
|
|
305 |
C |
p. 357-365
|
artikel
|
| 27 |
Reducing the domination number of
(
P
3
+
k
P
2
)
-free graphs via one edge contraction
|
Galby, E.
|
|
|
305 |
C |
p. 205-210
|
artikel
|
| 28 |
Reliability evaluation of DQcube based on g-good neighbor and g-component fault pattern
|
Zhang, Hong
|
|
|
305 |
C |
p. 179-190
|
artikel
|
| 29 |
Subdivisions of four blocks cycles in digraphs with large chromatic number
|
Al-Mniny, Darine
|
|
|
305 |
C |
p. 71-75
|
artikel
|
| 30 |
Super connectivity of folded twisted crossed cubes
|
Guo, Litao
|
|
|
305 |
C |
p. 56-63
|
artikel
|
| 31 |
Target set selection for conservative populations
|
Feige, Uriel
|
|
|
305 |
C |
p. 119-132
|
artikel
|
| 32 |
The
b
-Matching problem in distance-hereditary graphs and beyond
|
Ducoffe, Guillaume
|
|
|
305 |
C |
p. 233-246
|
artikel
|
| 33 |
The clique distribution in powers of hypercubes
|
Kou, Yongfang
|
|
|
305 |
C |
p. 76-85
|
artikel
|
| 34 |
The
h
-restricted connectivity of balanced hypercubes
|
Cheng, Dongqin
|
|
|
305 |
C |
p. 133-141
|
artikel
|
| 35 |
The localization game on Cartesian products
|
Boshoff, Jeandré
|
|
|
305 |
C |
p. 247-259
|
artikel
|
| 36 |
The power graph of a torsion-free group determines the directed power graph
|
Zahirović, Samir
|
|
|
305 |
C |
p. 109-118
|
artikel
|
| 37 |
Uniform forcing and immune sets in graphs and hypergraphs
|
Fàbrega, Josep
|
|
|
305 |
C |
p. 23-33
|
artikel
|
| 38 |
Variations of cops and robbers game on grids
|
Das, Sandip
|
|
|
305 |
C |
p. 340-349
|
artikel
|
| 39 |
Window queries for intersecting objects, maximal points and approximations using coresets
|
Chanchary, Farah
|
|
|
305 |
C |
p. 295-310
|
artikel
|
Tijdschrift beschrijving