| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A branch-and-cut algorithm for the routing and spectrum allocation problem
|
Bianchetti, Marcelo
|
|
|
339 |
C |
p. 107-126
|
artikel
|
| 2 |
A refined result on cross-intersecting families
|
Wu, Biao
|
|
|
339 |
C |
p. 149-153
|
artikel
|
| 3 |
A Triangle-free, 4-chromatic
Q
3
Euclidean distance graph Scavenger hunt!
|
Joe, Jonathan
|
|
|
339 |
C |
p. 216-226
|
artikel
|
| 4 |
Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices
|
Yang, Yu
|
|
|
339 |
C |
p. 184-201
|
artikel
|
| 5 |
Constant delay lattice train schedules
|
De Carufel, Jean-Lou
|
|
|
339 |
C |
p. 1-10
|
artikel
|
| 6 |
Counting maximal independent sets in some
n
-gonal cacti
|
Klamsakul, Natawat
|
|
|
339 |
C |
p. 234-280
|
artikel
|
| 7 |
Distributivity of a segmentation lattice
|
Pavlík, Jan
|
|
|
339 |
C |
p. 300-316
|
artikel
|
| 8 |
Double domination in rooted product graphs
|
Cabrera-Martínez, Abel
|
|
|
339 |
C |
p. 127-135
|
artikel
|
| 9 |
Editorial Board
|
|
|
|
339 |
C |
p. ii
|
artikel
|
| 10 |
Fixing knockout tournaments with seeds
|
Manurangsi, Pasin
|
|
|
339 |
C |
p. 21-35
|
artikel
|
| 11 |
Graphs with doubly resolving number 2
|
Jannesari, Mohsen
|
|
|
339 |
C |
p. 178-183
|
artikel
|
| 12 |
Graphs without gap-vertex-labellings: Families and bounds
|
Weffort-Santos, Celso A.
|
|
|
339 |
C |
p. 317-335
|
artikel
|
| 13 |
Hyper
K
1
,
r
and sub-
K
1
,
r
fault tolerance of star graphs
|
Yang, Yuxing
|
|
|
339 |
C |
p. 172-177
|
artikel
|
| 14 |
Immune sets in monotone infection rules. Characterization and complexity
|
Fàbrega, Josep
|
|
|
339 |
C |
p. 202-215
|
artikel
|
| 15 |
Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
|
Bonomo-Braberman, Flavia
|
|
|
339 |
C |
p. 53-77
|
artikel
|
| 16 |
Isolation of connected graphs
|
Borg, Peter
|
|
|
339 |
C |
p. 154-165
|
artikel
|
| 17 |
Locally irregular edge-coloring of subcubic graphs
|
Lužar, Borut
|
|
|
339 |
C |
p. 136-148
|
artikel
|
| 18 |
On maximum graphs in Tutte polynomial posets
|
Kahl, Nathan
|
|
|
339 |
C |
p. 78-88
|
artikel
|
| 19 |
On the
α
-index of minimally 2-connected graphs with given order or size
|
Lou, Jiayu
|
|
|
339 |
C |
p. 281-291
|
artikel
|
| 20 |
3-path-connectivity of Cayley graphs generated by transposition trees
|
Jin, Qihui
|
|
|
339 |
C |
p. 292-299
|
artikel
|
| 21 |
Some remarks on graphs with no induced subdivision of
K
4
|
Lan, Kaiyang
|
|
|
339 |
C |
p. 227-233
|
artikel
|
| 22 |
Some sufficient conditions for graphs being
k
-leaf-connected
|
Wu, Jiadong
|
|
|
339 |
C |
p. 11-20
|
artikel
|
| 23 |
Strict optimal rubbling of graphs
|
Murphy, Kyle
|
|
|
339 |
C |
p. 349-361
|
artikel
|
| 24 |
The difficulty of beating the Taxman
|
Franklín, Atli Fannar
|
|
|
339 |
C |
p. 166-171
|
artikel
|
| 25 |
The intermittent diagnosability for two families of interconnection networks under the PMC model and MM* model
|
Guo, Chen
|
|
|
339 |
C |
p. 89-106
|
artikel
|
| 26 |
The optimal way to play the most difficult repeated two-player coordination games
|
Kuusisto, Antti
|
|
|
339 |
C |
p. 36-52
|
artikel
|
| 27 |
Top to random shuffles on colored permutations
|
Nakano, Fumihiko
|
|
|
339 |
C |
p. 336-348
|
artikel
|
Tijdschrift beschrijving