|
|
|
Publications in Math-Net.Ru |
Citations |
|
1975 |
| 1. |
V. A. Liskovets, “On the number of vertices of a random acyclic digraph”, Teor. Veroyatnost. i Primenen., 20:2 (1975), 412–420    ; Theory Probab. Appl., 20:2 (1976), 401–409 |
9
|
|
1970 |
| 2. |
V. A. Liskovets, “The number of strongly connected directed graphs”, Mat. Zametki, 8:6 (1970), 721–732 ; Math. Notes, 8:6 (1970), 877–882 |
|
1969 |
| 3. |
V. A. Liskovets, “A recurrent method for the enumeration of graphs with labelled vertices”, Dokl. Akad. Nauk SSSR, 184:6 (1969), 1284–1287 |
1
|
|
| Organisations |
|
|
Contact us: