We consider plane trees whose vertices are given labels from the set {1, 2, . . . , k} in such a way that the sum of the labels along any edge is at most k + 1; it turns out that ...
We introduce the idea of Assur graphs, a concept originally developed and exclusively employed in the literature of the kinematics community. The paper translates the terminology,...
This article presents new bijections on planar maps. At first a bijection is established between bipolar orientations on planar maps and specific "transversal structures"...
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
A classical result of Euler states that the tangent numbers are an alternating sum of Eulerian numbers. A dual result of Roselle states that the secant numbers can be obtained by a...