A decomposition of a non-empty simple graph G is a pair [G,P] such that P is a set of non-empty induced subgraphs of G, and every edge of G belongs to exactly one subgraph in P. The chromatic index ¿'([G,P]) of a decomposition ...

We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be defined as the arithmetic mean of the distances between all pairs of vertices. This parameter ...

We propose the study of counting problems for geometric graphs defined on point sets in convex position. Many formulae are known, for instance the numbers of triangulations are given by the Catalan numbers. Our approach ...