nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Chromatic-choosability of the power of graphs
|
Kim, Seog-Jin |
|
2015 |
180 |
C |
p. 120-125 6 p. |
artikel |
2 |
Coloring graphs characterized by a forbidden subgraph
|
Golovach, Petr A. |
|
2015 |
180 |
C |
p. 101-110 10 p. |
artikel |
3 |
Complexity of splits reconstruction for low-degree trees
|
Gaspers, Serge |
|
2015 |
180 |
C |
p. 89-100 12 p. |
artikel |
4 |
Contents
|
|
|
2015 |
180 |
C |
p. v-vi nvt p. |
artikel |
5 |
Decomposition of circulant digraphs with two jumps into cycles of equal lengths
|
Bogdanowicz, Zbigniew R. |
|
2015 |
180 |
C |
p. 45-51 7 p. |
artikel |
6 |
Delta–wye reduction of almost-planar graphs
|
Wagner, Donald K. |
|
2015 |
180 |
C |
p. 158-167 10 p. |
artikel |
7 |
Equitable colorings of Cartesian products with balanced complete multipartite graphs
|
Yan, Zhidan |
|
2015 |
180 |
C |
p. 200-203 4 p. |
artikel |
8 |
Excluding cycles with a fixed number of chords
|
Aboulker, Pierre |
|
2015 |
180 |
C |
p. 11-24 14 p. |
artikel |
9 |
Finding the closest ultrametric
|
Di Summa, Marco |
|
2015 |
180 |
C |
p. 70-80 11 p. |
artikel |
10 |
Global majority consensus by local majority polling on graphs of a given degree sequence
|
Abdullah, Mohammed Amin |
|
2015 |
180 |
C |
p. 1-10 10 p. |
artikel |
11 |
How many double squares can a string contain?
|
Deza, Antoine |
|
2015 |
180 |
C |
p. 52-69 18 p. |
artikel |
12 |
Maximum Estrada index of bicyclic graphs
|
Wang, Long |
|
2015 |
180 |
C |
p. 194-199 6 p. |
artikel |
13 |
Minimum number of affine simplices of given dimension
|
Szalkai, István |
|
2015 |
180 |
C |
p. 141-149 9 p. |
artikel |
14 |
Multiplicative Zagreb indices of k -trees
|
Wang, Shaohui |
|
2015 |
180 |
C |
p. 168-175 8 p. |
artikel |
15 |
On edge-b-critical graphs
|
Eschouf, Noureddine Ikhlef |
|
2015 |
180 |
C |
p. 176-180 5 p. |
artikel |
16 |
On graphs with excess or defect 2
|
Garbe, Frederik |
|
2015 |
180 |
C |
p. 81-88 8 p. |
artikel |
17 |
On the construction of non- 2 -colorable uniform hypergraphs
|
Mathews, Jithin |
|
2015 |
180 |
C |
p. 181-187 7 p. |
artikel |
18 |
On the number of optimal identifying codes in a twin-free graph
|
Honkala, Iiro |
|
2015 |
180 |
C |
p. 111-119 9 p. |
artikel |
19 |
On the tractability of some natural packing, covering and partitioning problems
|
Bernáth, Attila |
|
2015 |
180 |
C |
p. 25-35 11 p. |
artikel |
20 |
Some efficiently solvable problems over integer partition polytopes
|
Onn, Shmuel |
|
2015 |
180 |
C |
p. 135-140 6 p. |
artikel |
21 |
Sum-free cyclic multi-bases and constructions of Ramsey algebras
|
Alm, Jeremy F. |
|
2015 |
180 |
C |
p. 204-212 9 p. |
artikel |
22 |
The fast robber on interval and chordal graphs
|
Mehrabian, Abbas |
|
2015 |
180 |
C |
p. 188-193 6 p. |
artikel |
23 |
The height and width of bargraphs
|
Blecher, Aubrey |
|
2015 |
180 |
C |
p. 36-44 9 p. |
artikel |
24 |
The signed Roman k -domatic number of a graph
|
Volkmann, Lutz |
|
2015 |
180 |
C |
p. 150-157 8 p. |
artikel |
25 |
Weight-constrained and density-constrained paths in a tree: Enumerating, counting, and k -maximum density paths
|
Lee, Chia-Wei |
|
2015 |
180 |
C |
p. 126-134 9 p. |
artikel |