-
1
-
-
0043192331
-
Computation of the expected number of leaves in a tree having a given automorphism, and related topics
-
F. Bergeron, G. Labelle and P. Leroux, Computation of the expected number of leaves in a tree having a given automorphism, and related topics, Discrete Appl. Math. 34 (1991) 49-66.
-
(1991)
Discrete Appl. Math.
, vol.34
, pp. 49-66
-
-
Bergeron, F.1
Labelle, G.2
Leroux, P.3
-
2
-
-
38249000525
-
Q-énumeration de polyominos convexes
-
M. Bousquet-Mélou, q-Énumeration de polyominos convexes, J. Combin. Theory Ser. A 64 (1993) 265-288.
-
(1993)
J. Combin. Theory Ser. A
, vol.64
, pp. 265-288
-
-
Bousquet-Mélou, M.1
-
3
-
-
0003228035
-
Problèmes combinatoires de commutation et réarrangement
-
Springer, Berlin
-
P. Cartier and D. Foata, Problèmes combinatoires de commutation et réarrangement, Lecture Notes in Mathematics, vol. 85 (Springer, Berlin, 1969).
-
(1969)
Lecture Notes in Mathematics
, vol.85
-
-
Cartier, P.1
Foata, D.2
-
4
-
-
0043192330
-
A noncommutative version of the matrix inversion formula
-
D. Foata, A noncommutative version of the matrix inversion formula, Adv. Math. 31 (1979) 330-339.
-
(1979)
Adv. Math.
, vol.31
, pp. 330-339
-
-
Foata, D.1
-
5
-
-
0039585573
-
Enumerative applications of a decomposition for graphs and digraphs
-
I.M. Gessel, Enumerative applications of a decomposition for graphs and digraphs, Discrete Math. 139 (1995) 257-271.
-
(1995)
Discrete Math.
, vol.139
, pp. 257-271
-
-
Gessel, I.M.1
-
6
-
-
13744249216
-
The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
-
The Foata Festschrift special issue
-
I.M. Gessel and B.E. Sagan, The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions, Electronic J. Combinatorics 3, No. 2 (1996) (The Foata Festschrift special issue), R9.
-
(1996)
Electronic J. Combinatorics
, vol.3
, Issue.2
-
-
Gessel, I.M.1
Sagan, B.E.2
-
7
-
-
0041689409
-
On the number of maximal vertices of a random acyclic digraph
-
V.A. Liskovets, On the number of maximal vertices of a random acyclic digraph, Theory Probab. Appl. 20 (1975) 401-409
-
(1975)
Theory Probab. Appl.
, vol.20
, pp. 401-409
-
-
Liskovets, V.A.1
-
8
-
-
0042655294
-
The number of labeled k-trees
-
J.W. Moon, The number of labeled k-trees, J. Combin. Theory 6 (1969) 196-199
-
(1969)
J. Combin. Theory
, vol.6
, pp. 196-199
-
-
Moon, J.W.1
-
9
-
-
0001457227
-
Counting labeled acyclic digraphs
-
F. Harary, ed., Academic Press, New York
-
R.W. Robinson, Counting labeled acyclic digraphs, in: F. Harary, ed., New Directions in the Theory of Graphs, Proc. Third Ann Arbor Conference on Graph Theory (Academic Press, New York, 1971) 239-273.
-
(1971)
New Directions in the Theory of Graphs, Proc. Third Ann Arbor Conference on Graph Theory
, pp. 239-273
-
-
Robinson, R.W.1
-
10
-
-
38249009239
-
On the number of labeled acyclic digraphs
-
V.I. Rodionov, On the number of labeled acyclic digraphs, Discrete Math. 105 (1992) 319-321.
-
(1992)
Discrete Math.
, vol.105
, pp. 319-321
-
-
Rodionov, V.I.1
-
11
-
-
0000192604
-
Acyclic orientations of graphs
-
R.P. Stanley, Acyclic orientations of graphs, Discrete Math. 5 (1973) 171-178.
-
(1973)
Discrete Math.
, vol.5
, pp. 171-178
-
-
Stanley, R.P.1
-
12
-
-
0000270261
-
Heaps of pieces, I: Basic definitions and combinatorial lemmas
-
G. Labelle and P. Leroux, eds., Combinatoire Enumerative. Proceedings, Montréal, Québec 1985, Springer, Berlin
-
G.X. Viennot, Heaps of pieces, I: basic definitions and combinatorial lemmas, in: G. Labelle and P. Leroux, eds., Combinatoire Enumerative. Proceedings, Montréal, Québec 1985, Lecture Notes in Mathematics, vol. 1234 (Springer, Berlin, 1986) 321-350.
-
(1986)
Lecture Notes in Mathematics
, vol.1234
, pp. 321-350
-
-
Viennot, G.X.1
|