1. Belov, Y.A., On clique number of matroid skeleton, in Modeli issledovaniya operacii v vychislitel’nykh sistemakh (Models of Operations Research in Computer Systems), Yaroslavl, 1985, pp. 95–100
2. Bondarenko, V.A., Complexity bounds for combinatorial optimization problems in one class of algorithms, Russ. Acad. Sci. Dokl. Math., 1993, vol. 328, no 1, pp. 22–24.
3. Bondarenko, V.A. and Maksimenko, A.N., Geometricheskie konstruktsii i slozhnost’ v kombinatornoi optimizatsii (Geometric Constructs and Complexity in Combinatorial Optimization), Moscow: LKI, 2008.
4. Bondarenko, V.A. and Nikolaev, A.V., Combinatorial and geometric properties of the max-cut and min-cut problems, Dokl. Math., 2013, vol. 88, no. 2, pp. 516–517.
5. Brondsted, A., An Introduction to Convex Polytopes, Springer-Verlag, 1983.