| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Absolute algebraic connectivity of double brooms and trees
|
Richter, Sebastian
|
|
2016
|
201 |
C |
p. 213-221
9 p.
|
article
|
| 2 |
Almost every graph is divergent under the biclique operator
|
Groshaus, Marina
|
|
2016
|
201 |
C |
p. 130-140
11 p.
|
article
|
| 3 |
An exact algorithm for the bottleneck 2-connected
k
-Steiner network problem in
L
p
planes
|
Brazil, M.
|
|
2016
|
201 |
C |
p. 47-69
23 p.
|
article
|
| 4 |
A proof of the conjecture regarding the sum of domination number and average eccentricity
|
Du, Zhibin
|
|
2016
|
201 |
C |
p. 105-113
9 p.
|
article
|
| 5 |
Conditional diagnosability of bubble-sort star graphs
|
Guo, Jia
|
|
2016
|
201 |
C |
p. 141-149
9 p.
|
article
|
| 6 |
Contents
|
|
|
2016
|
201 |
C |
p. v-vi
nvt p.
|
article
|
| 7 |
Convex hulls of superincreasing knapsacks and lexicographic orderings
|
Gupte, Akshay
|
|
2016
|
201 |
C |
p. 150-163
14 p.
|
article
|
| 8 |
Facets of the axial three-index assignment polytope
|
Dokka, Trivikram
|
|
2016
|
201 |
C |
p. 86-104
19 p.
|
article
|
| 9 |
Further hardness results on rainbow and strong rainbow connectivity
|
Lauri, Juho
|
|
2016
|
201 |
C |
p. 191-200
10 p.
|
article
|
| 10 |
Further result on acyclic chromatic index of planar graphs
|
Wang, Tao
|
|
2016
|
201 |
C |
p. 228-247
20 p.
|
article
|
| 11 |
Integer sequence discovery from small graphs
|
Hoppe, Travis
|
|
2016
|
201 |
C |
p. 172-181
10 p.
|
article
|
| 12 |
Network decontamination under
m
-immunity
|
Flocchini, Paola
|
|
2016
|
201 |
C |
p. 114-129
16 p.
|
article
|
| 13 |
On orthogonal ray trees
|
Mustaţă, Irina
|
|
2016
|
201 |
C |
p. 201-212
12 p.
|
article
|
| 14 |
On
r
-dynamic chromatic number of graphs
|
Taherkhani, Ali
|
|
2016
|
201 |
C |
p. 222-227
6 p.
|
article
|
| 15 |
On the structure and deficiency of
k
-trees with bounded degree
|
Borowiecka-Olszewska, Marta
|
|
2016
|
201 |
C |
p. 24-37
14 p.
|
article
|
| 16 |
Scheduling co-operating stacking cranes with predetermined container sequences
|
Briskorn, Dirk
|
|
2016
|
201 |
C |
p. 70-85
16 p.
|
article
|
| 17 |
Semi-transitive orientations and word-representable graphs
|
Halldórsson, Magnús M.
|
|
2016
|
201 |
C |
p. 164-171
8 p.
|
article
|
| 18 |
Some new characterizations of Hamiltonian cycles in triangular grid graphs
|
Bodroža-Pantić, Olga
|
|
2016
|
201 |
C |
p. 1-13
13 p.
|
article
|
| 19 |
Super-simple
(
v
,
4
,
2
)
directed designs and a lower bound for the minimum size of their defining set
|
Boostan, M.
|
|
2016
|
201 |
C |
p. 14-23
10 p.
|
article
|
| 20 |
The competition graphs of oriented complete bipartite graphs
|
Kim, Suh-Ryung
|
|
2016
|
201 |
C |
p. 182-190
9 p.
|
article
|
| 21 |
Weighted efficient domination in two subclasses of
P
6
-free graphs
|
Brandstädt, Andreas
|
|
2016
|
201 |
C |
p. 38-46
9 p.
|
article
|
Journal description