| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Analysis on Yu et al.’s dynamic algorithm for canonic DBC
|
Eom, Sookyung
|
|
|
294 |
C |
p. 31-40
|
artikel
|
| 2 |
A new approach to finding the extra connectivity of graphs
|
Zhu, Qiang
|
|
|
294 |
C |
p. 265-271
|
artikel
|
| 3 |
A recognition algorithm for adjusted interval digraphs
|
Takaoka, Asahi
|
|
|
294 |
C |
p. 253-256
|
artikel
|
| 4 |
Characterizing the fullerene graphs with the minimum forcing number 3
|
Shi, Lingjuan
|
|
|
294 |
C |
p. 181-204
|
artikel
|
| 5 |
Circuit k -covers of signed graphs
|
Chen, Jing
|
|
|
294 |
C |
p. 41-54
|
artikel
|
| 6 |
Connectivity and diagnosability of center k -ary n -cubes
|
Wang, Mujiangshan
|
|
|
294 |
C |
p. 98-107
|
artikel
|
| 7 |
Distances in graphs of girth 6 and generalised cages
|
Alochukwu, Alex
|
|
|
294 |
C |
p. 125-137
|
artikel
|
| 8 |
Edge-disjoint paths in faulty augmented cubes
|
Ma, Meijie
|
|
|
294 |
C |
p. 108-114
|
artikel
|
| 9 |
Editorial Board
|
|
|
|
294 |
C |
p. ii
|
artikel
|
| 10 |
Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices
|
Kuo, Che-Nan
|
|
|
294 |
C |
p. 1-9
|
artikel
|
| 11 |
Every planar graph is 1-defective ( 9 , 2 ) -paintable
|
Han, Ming
|
|
|
294 |
C |
p. 257-264
|
artikel
|
| 12 |
Minimum Spanning Tree Cycle Intersection problem
|
Dubinsky, Manuel
|
|
|
294 |
C |
p. 152-166
|
artikel
|
| 13 |
On star 5-colorings of sparse graphs
|
Choi, Ilkyoo
|
|
|
294 |
C |
p. 233-252
|
artikel
|
| 14 |
On three outer-independent domination related parameters in graphs
|
Mojdeh, Doost Ali
|
|
|
294 |
C |
p. 115-124
|
artikel
|
| 15 |
Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
|
Chen, Xiaozheng
|
|
|
294 |
C |
p. 167-180
|
artikel
|
| 16 |
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks
|
Erdős, Péter L.
|
|
|
294 |
C |
p. 205-213
|
artikel
|
| 17 |
The advantage of truncated permutations
|
Gilboa, Shoni
|
|
|
294 |
C |
p. 214-223
|
artikel
|
| 18 |
The complexity of recognizing minimally tough graphs
|
Katona, Gyula Y.
|
|
|
294 |
C |
p. 55-84
|
artikel
|
| 19 |
The dual Lovász extension operator and the Shapley extension operator for TU games
|
Casajus, André
|
|
|
294 |
C |
p. 224-232
|
artikel
|
| 20 |
Unrooted non-binary tree-based phylogenetic networks
|
Fischer, Mareike
|
|
|
294 |
C |
p. 10-30
|
artikel
|
| 21 |
Various characterizations of throttling numbers
|
Carlson, Joshua
|
|
|
294 |
C |
p. 85-97
|
artikel
|
| 22 |
Vectorial bent functions weakly/strongly outside the completed Maiorana–McFarland class
|
Pasalic, E.
|
|
|
294 |
C |
p. 138-151
|
artikel
|
Tijdschrift beschrijving