Bounds for the Number of Perfect Matchings in Hexagonal Systems
Calculating the number of the linear factors in planar graphs.
Canonical decomposition of outerplanar maps and application to enumeration, coding and generation.
Chohomological Aspects of Two-Graphs.
Chromatic Polynomials of Mixed Hypercycles
We color the vertices of each of the edges of a C-hypergraph (or cohypergraph) in such a way that at least two vertices receive the same color and in every proper coloring of a B-hypergraph (or bihypergraph), we forbid the cases when the vertices of any of its edges are colored with the same color (monochromatic) or when they are all colored with distinct colors (rainbow). In this paper, we determined explicit formulae for the chromatic polynomials of C-hypercycles and B-hypercycles
Classification of -dipoles on nonorientable surfaces.
Coefficients of functional compositions often grow smoothly.
Colored Prüfer codes for -edge colored trees.
Combinatorial aspects of an exact sequence that is related to a graphs.
Combinatorics and cluster expansions.
Compositions of graphs revisited.
Correction to "The bias of three pseudo-random shuffles", Volume 22, 2/3 (1981), p. 268-292.
Counting and selecting at random bipartite graphs with fixed degrees
Counting forests by descents and leaves.
Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.
Counting points of slope varieties over finite fields.
Counting rooted trees: the universal law .
Counting set covers and split graphs.
Counting two-graphs related to trees.
Counting unlabelled topologies and transitive relations.