1. A. A. Ageev, V. P. Il’ev, A. V. Kononov, and A. S. Talevnin, “Computational Complexity of the Graph Approximation Problem,” Diskretn. Anal. Issled. Oper. Ser. 1, 13 (1), 3–15 (2006) [J. Appl. Indust. Math. 1 (1), 1–8 (2007)].
2. S. I. Bastrakov and N. Yu. Zolotykh, “Fast Method for Verifying Chernikov Rules in Fourier–Motzkin Elimination,” Zh. Vychisl.Mat. Mat. Fiz. 55 (1), 165–172 (2015) [Comput.Math.Math. Phys. 55 (1), 160–167 (2015)].
3. V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polytopes, Graphs, and Optimization (Nauka, Moscow, 1981; Cambridge Univ. Press, New York, 1984).
4. V. P. Il’ev, S. D. Il’eva, and A. A. Navrotskaya, “Approximation Algorithms for Graph Approximation Problems,” Diskretn.Anal. Issled.Oper. 18 (1), 41–60 (2011) [J. Appl. Indust.Math. 5 (4), 569–581 (2011)].
5. R. Yu. Simanchev, “On Rank Inequalities That Generate Facets of a Connected k-Factors Polytope,” Diskretn. Anal. Issled. Oper. 3 (3), 84–110 (1996).