1. C. Bergé, Théorie des graphes et ses applications (Dunod, Paris, 1958; Inostrannaya Literatura, Moscow, 1962).
2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness (Freeman, San Francisco, 1979; Mir, Moscow, 1982).
3. V. A. Emelichev, O. I. Mel’nikov, V. I. Sarvanov, and R. I. Tyshkevich, Lectures on Graph Theory (Nauka, Moscow, 1990; B. I. Wissenschaftsverlag, Mannheim, 1994).
4. Yu. A. Kartynnik and Yu. L. Orlovich, “Domination Triangle Graphs and Upper Bound Graphs,” Dokl. Nats. Akad. Nauk Belarusi 58 (1), 16–25 (2014).
5. Yu. L. Orlovich, V. S. Gordon, J. Blazewicz, I. E. Zverovich, and G. Finke, “Independent Dominating and Neighborhood Sets in Triangular Graphs,” Dokl. Nats. Akad. Nauk Belarusi 53 (1), 39–44 (2009).