Volume 25, No 2, 2018
Content

V. E. Alekseev and S. V. Sorochan
New cases of the polynomial solvability of the independent set problem for graphs with forbidden paths
P. 5-18

S. V. Kitaev and A. V. Pyatkin
Word-representable graphs: A survey
P. 19-53

V. K. Leontiev
On a partial order related to divisibility
P. 54-61

K. A. Popkov
Complete fault detection tests of length 2 for logic networks under stuck-at faults of gates
P. 62-81

E. V. Prosolupov and G. Sh. Tamasyan
Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function
P. 82-100

D. S. Taletskii and D. S. Malyshev
On trees of bounded degree with maximal number of greatest independent sets
P. 101-123

V. M. Fomichev
Semigroup and metric characteristics of locally primitive matrices and graphs
P. 124-143