|
|
|
Publications in Math-Net.Ru |
Citations |
|
2013 |
| 1. |
I. A. Badekha, P. V. Roldugin, “Density of graphs in which each edge is contained in at least two maximal cliques”, Diskr. Mat., 25:3 (2013), 7–21    ; Discrete Math. Appl., 24:1 (2014), 1–12  |
1
|
| 2. |
I. A. Badekha, “Edge clique coverings of graphs”, Prikl. Diskr. Mat., 2013, no. 1(19), 69–83 |
|
2010 |
| 3. |
I. A. Badeha, P. V. Roldugin, “About relationship between parameters of certain graphs”, Prikl. Diskr. Mat., 2010, no. supplement № 3, 94–95 |
|
2009 |
| 4. |
I. A. Badeha, P. V. Roldugin, “Some properties of graph edge clique coverings”, Prikl. Diskr. Mat., 2009, no. supplement № 1, 95–96 |
|
| Organisations |
|
|
