Dartboard arrangements.
Décompositions d'un intervalle réel et des ensembles de Cantor
Decreases and descents in words.
Dénombrements relatifs à une définition combinatoire de la continuité sur un graphe
Derangements and asymptotics of the Laplace transforms of large powers of a polynomial.
Des permutations
Descents of derangements and circular words. (Descentes des dérangements et mots circulaires.)
Determining lower bounds for packing densities of non-layered patterns using weighted templates.
Deux propriétés combinatoires du langage de Lukasiewicz
Die Kombinationen gegebenen Profils. I
Die Kombinationen gegebenen Profils. II
Die Kombinationen gegebenen Profils. III
Distribution of segment lengths in genome rearrangements.
Dodgon's determinant-evaluation rule proved by TWO-TIMING MEN and WOMEN.
Domination in functigraphs
Let G₁ and G₂ be disjoint copies of a graph G, and let f:V(G₁) → V(G₂) be a function. Then a functigraph C(G,f) = (V,E) has the vertex set V = V(G₁) ∪ V(G₂) and the edge set E = E(G₁) ∪ E(G₂) ∪ {uv | u ∈ V(G₁), v ∈ V(G₂),v = f(u)}. A functigraph is a generalization of a permutation graph (also known as a generalized prism) in the sense of Chartrand and Harary. In this paper, we study domination in functigraphs. Let γ(G) denote the domination number of G. It is readily seen that γ(G) ≤ γ(C(G,f))...
Duality of antidiagonals and pipe dreams.