|
|
|
Publications in Math-Net.Ru |
Citations |
|
2004 |
| 1. |
I. É. Zverovich, “Weighted well-covered graphs and complexity questions”, Mosc. Math. J., 4:2 (2004), 523–528     |
|
2001 |
| 2. |
I. É. Zverovich, “Strong $k$-colorings of graphs”, Diskr. Mat., 13:1 (2001), 78–89 ; Discrete Math. Appl., 11:1 (2001), 83–94 |
|
2000 |
| 3. |
I. É. Zverovich, “A characterization of well-covered graphs in terms of forbidden costable subgraphs”, Mat. Zametki, 67:1 (2000), 52–56 ; Math. Notes, 67:1 (2000), 41–44 |
4
|
|
1998 |
| 4. |
I. É. Zverovich, “Locally bounded hereditary subclasses of $k$-colorable graphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 5:3 (1998), 3–16 |
|
1997 |
| 5. |
I. É. Zverovich, “An analogue of the Whitney theorem for edge graphs of multigraphs, and edge multigraphs”, Diskr. Mat., 9:2 (1997), 98–105 ; Discrete Math. Appl., 7:3 (1997), 287–294 |
2
|
|
1990 |
| 6. |
V. È. Zverovich, I. É. Zverovich, R. I. Tyshkevich, “Graphs with a matroid number that does not exceed 2”, Diskr. Mat., 2:2 (1990), 82–88 |
|
| Organisations |
|
| |
|
|
Contact us: