#### Filter Results:

- Full text PDF available (13)

#### Publication Year

1981

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We investigate properties of a multivariate function E(m1,m2, . . . ,mr), called orbicyclic, that arises in enumerative combinatorics in counting non-isomorphic maps on orientable surfaces. E(m1,m2, . . . ,mr) proves to be multiplicative, and a simple formula for its calculation is provided. It is shown that the necessary and sufficient conditions for this… (More)

- Valery A. Liskovets
- Journal of Graph Theory
- 1981

- Valery A. Liskovets
- J. Comb. Theory, Ser. B
- 1999

- Valery A. Liskovets
- Discrete Applied Mathematics
- 2006

- Valery A. Liskovets, Timothy R. S. Walsh
- Discrete Mathematics
- 2004

Sum-free enumerative formulae are derived for several classes of rooted planar maps with no vertices of odd valency (eulerian maps) and with two vertices of odd valency (unicursal maps). As corollaries we obtain simple formulae for the numbers of unrooted eulerian and unicursal planar maps. Also, we obtain a sum-free formula for the number of rooted… (More)

- Valery A. Liskovets
- Discrete Mathematics
- 1996

- Valery A. Liskovets, Reinhard Pöschel
- Journal of Graph Theory
- 2000

- Valery A. Liskovets
- Electr. J. Comb.
- 2004

We present uniformly available simple enumerative formulae for unrooted planar n-edge maps (counted up to orientation-preserving isomorphism) of numerous classes including arbitrary, loopless, non-separable, eulerian maps and plane trees. All the formulae conform to a certain pattern with respect to the terms of the sum over t | n, t < n. Namely, these… (More)

- Valery A. Liskovets
- Combinatorics, Probability & Computing
- 1996

We propose and discuss several simple ways of obtaining new enumerative sequences from existing ones. For instance, the number of graphs considered up to the action of an involutory transformation is expressible as the semi-sum of the total number of such graphs and the number of graphs invariant under the involution. Another, less familiar idea concerns… (More)