ENUMERATION OF NOISOMORPHIC PLANAR MAPS VA Liskovets | 76 | 1981 |
A census of non-isomorphic planar maps VA Liskovets Coll. Math. Soc. J. Bolyai, Proc. Conf. Algebr. Meth. in Graph Th 25, 2, 1981 | 47 | 1981 |
On the enumeration of subgroups of a free group VA Liskovets Dokl. Akad. Nauk BSSR 15 (1), 6-9, 1971 | 41 | 1971 |
A pattern of asymptotic vertex valency distributions in planar maps VA Liskovets Journal of Combinatorial Theory, Series B 75 (1), 116-133, 1999 | 40 | 1999 |
Exact enumeration of acyclic deterministic automata VA Liskovets Discrete Applied Mathematics 154 (3), 537-551, 2006 | 39 | 2006 |
Sequential generation of arrangements by means of a basis of transpositions VL Kompel'makher, VA Liskovets Cybernetics 11 (3), 362-366, 1975 | 38 | 1975 |
A reductive technique for enumerating non-isomorphic planar maps VA Liskovets Discrete Mathematics 156 (1-3), 197-217, 1996 | 34 | 1996 |
Ten steps to counting planar graphs VA Liskovets, TR Walsh Department of Computer Science, University of Western Ontario, 1985 | 33 | 1985 |
A multivariate arithmetic function of combinatorial and topological significance VA Liskovets Walter de Gruyter GmbH & Co. KG 10 (1), 155-177, 2010 | 32 | 2010 |
Enumeration of eulerian and unicursal planar maps VA Liskovets, TRS Walsh Discrete mathematics 282 (1-3), 209-221, 2004 | 31 | 2004 |
Reductive enumeration under mutually orthogonal group actions V Liskovets Acta Applicandae Mathematica 52, 91-120, 1998 | 30 | 1998 |
Enumeration of subgroups in the fundamental groups of orientable circle bundles over surfaces V Liskovets, A Mednykh Communications in Algebra 28 (4), 1717-1738, 2000 | 29 | 2000 |
The enumeration of non-isomorphic 2-connected planar maps VA Liskovets, TRS Walsh Canadian journal of mathematics 35 (3), 417-435, 1983 | 27 | 1983 |
On the number of maximal vertices of a random acyclic digraph VA Liskovets Theory of Probability & Its Applications 20 (2), 401-409, 1976 | 27 | 1976 |
Analytical enumeration of circulant graphs with prime-squared number of vertices M Klin, V Liskovets, R Pöschel Sém. Lotharing. Combin 36, B36d, 1996 | 25 | 1996 |
Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems V Liskovets, R Pöschel Discrete Mathematics 214 (1-3), 173-191, 2000 | 20 | 2000 |
The number of connected initial automata VA Liskovets Cybernetics 5 (3), 259-262, 1969 | 18 | 1969 |
A recurrent method for the enumeration of graphs with labelled vertices VA Liskovets Doklady Akademii Nauk 184 (6), 1284-1287, 1969 | 18 | 1969 |
Non‐Cayley‐isomorphic self‐complementary circulant graphs V Liskovets, R Pöschel Journal of Graph Theory 34 (2), 128-141, 2000 | 17 | 2000 |
Enumerative formulae for unrooted planar maps: a pattern VA Liskovets the electronic journal of combinatorics, R88-R88, 2004 | 16 | 2004 |