|
|
Publications in Math-Net.Ru |
Citations |
|
2020 |
1. |
Ya. A. Loverov, Yu. L. Orlovich, “NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs”, Diskretn. Anal. Issled. Oper., 27:2 (2020), 65–89 ; J. Appl. Industr. Math., 14:2 (2020), 352–366 |
3
|
2. |
P. A. Irzhavski, Yu. L. Orlovich, “Perfect matchings and $K_{1, p}$-restricted graphs”, Diskr. Mat., 32:1 (2020), 27–50 ; Discrete Math. Appl., 30:6 (2020), 391–408 |
|
2017 |
3. |
P. A. Irzhavskii, Yu. A. Kartynnik, Yu. L. Orlovich, “$1$-Triangle graphs and perfect neighborhood sets”, Diskretn. Anal. Issled. Oper., 24:1 (2017), 56–80 ; J. Appl. Industr. Math., 11:1 (2017), 58–69 |
|
2012 |
4. |
P. A. Irzhavski, Yu. L. Orlovich, “Full cycle extendability of locally connected $K_{1,4}$-restricted graphs”, Tr. Inst. Mat., 20:2 (2012), 36–50 |
|
2002 |
5. |
Yu. L. Orlovich, “Coverings by cliques, factors and graphs with isomorphic vertex neighborhoods”, Diskretn. Anal. Issled. Oper., Ser. 1, 9:2 (2002), 48–90 |
|
Organisations |
|
|
|
|