| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
An implicit degree condition for k-connected 2-heavy graphs to be hamiltonian
|
Cai, Junqing
|
|
2018
|
134 |
C |
p. 9-13
|
article
|
| 2 |
An improved upper bound of edge–vertex domination number of a tree
|
Venkatakrishnan, Y.B.
|
|
2018
|
134 |
C |
p. 14-17
|
article
|
| 3 |
Are unique subgraphs not easier to find?
|
Kowaluk, Mirosław
|
|
2018
|
134 |
C |
p. 57-61
|
article
|
| 4 |
Cartesian product digraphs with optimal restricted arc connectivity
|
Lin, Shangwei
|
|
2018
|
134 |
C |
p. 72-75
|
article
|
| 5 |
Double Roman domination in trees
|
Zhang, Xiujun
|
|
2018
|
134 |
C |
p. 31-34
|
article
|
| 6 |
Editorial Board
|
|
|
2018
|
134 |
C |
p. ii
|
article
|
| 7 |
Efficient quantum key distribution using Fibonacci-number coding with a biased basis choice
|
Lai, Hong
|
|
2018
|
134 |
C |
p. 24-30
|
article
|
| 8 |
General parametric scheme for the online uniform machine scheduling problem with two different speeds
|
Dolgui, Alexandre
|
|
2018
|
134 |
C |
p. 18-23
|
article
|
| 9 |
Gradient/Hessian-enhanced least square support vector regression
|
Jiang, Ting
|
|
2018
|
134 |
C |
p. 1-8
|
article
|
| 10 |
Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems
|
Vágvölgyi, Sándor
|
|
2018
|
134 |
C |
p. 47-51
|
article
|
| 11 |
On colouring (2P 2,H)-free and (P 5,H)-free graphs
|
Dabrowski, Konrad K.
|
|
2018
|
134 |
C |
p. 35-41
|
article
|
| 12 |
On f-colorings of nearly bipartite graphs
|
Zhang, Yuzhuo
|
|
2018
|
134 |
C |
p. 67-71
|
article
|
| 13 |
Quasi chain rule for min-entropy
|
Dziembowski, Stefan
|
|
2018
|
134 |
C |
p. 62-66
|
article
|
| 14 |
Some results on the inverse sum indeg index of a graph
|
An, Mingqiang
|
|
2018
|
134 |
C |
p. 42-46
|
article
|
| 15 |
The pessimistic diagnosability of data center networks
|
Gu, Mei-Mei
|
|
2018
|
134 |
C |
p. 52-56
|
article
|
Journal description