nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Alternating L -functions of finite digraphs
|
Wu, Yongjiang |
|
|
370 |
C |
p. 34-49 |
artikel |
2 |
Claw-free minimal matching covered graphs
|
Zhang, Yipei |
|
|
370 |
C |
p. 11-21 |
artikel |
3 |
Clique Cover on L-EPG representations of graphs
|
Silva, Kedson Alves |
|
|
370 |
C |
p. 145-156 |
artikel |
4 |
Coherent domains and improved lower bounds for the maximum size of Condorcet domains
|
Karpov, Alexander |
|
|
370 |
C |
p. 57-70 |
artikel |
5 |
Computational complexity of the recoverable robust shortest path problem with discrete recourse
|
Jackiewicz, Marcel |
|
|
370 |
C |
p. 103-110 |
artikel |
6 |
Edge isoperimetric method: At least 2 / 3 of h -extra edge-connectivity of a kind of cube-based graphs concentrates on 2 n − 1
|
Zhang, Mingzu |
|
|
370 |
C |
p. 167-174 |
artikel |
7 |
Editorial Board
|
|
|
|
370 |
C |
p. ii |
artikel |
8 |
Fault-tolerability analysis of hypercubes based on 3-component path-structure connectivity
|
Zhu, Bo |
|
|
370 |
C |
p. 111-123 |
artikel |
9 |
Injective edge chromatic index of sparse graphs
|
Hu, Xiaolan |
|
|
370 |
C |
p. 50-56 |
artikel |
10 |
K 4 -free planar minimal bricks with the maximum number of edges
|
Zhou, Jinqiu |
|
|
370 |
C |
p. 92-102 |
artikel |
11 |
Measures of closeness to cordiality for graphs
|
Brahmbhatt, Anand |
|
|
370 |
C |
p. 157-166 |
artikel |
12 |
Optimal algorithms for online batch scheduling with all possible equal-processing times under periodic pulse interruptions
|
Lin, Ran |
|
|
370 |
C |
p. 71-83 |
artikel |
13 |
Practical KMP/BM style pattern-matching on indeterminate strings
|
Dehghani, Hossein |
|
|
370 |
C |
p. 22-33 |
artikel |
14 |
Rainbow transitive triangles in arc-colored digraphs
|
Duan, Mengyu |
|
|
370 |
C |
p. 175-184 |
artikel |
15 |
Spectra of the Mycielskian of a signed graph and related products
|
Ul Rashid, Mir Riyaz |
|
|
370 |
C |
p. 124-144 |
artikel |
16 |
Strict neighbor-distinguishing index of outerplanar graphs
|
Wang, Weifan |
|
|
370 |
C |
p. 1-10 |
artikel |
17 |
The chromatic number of odd-hole-free graphs
|
Chen, Rong |
|
|
370 |
C |
p. 84-87 |
artikel |
18 |
The interval coloring impropriety of planar graphs
|
Lee, Seunghun |
|
|
370 |
C |
p. 88-91 |
artikel |