One proves that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen in [7] (see also [10]), are top intersection numbers in the cohomology ring of...
Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria f...
For a positive integer k and a graph G, the k-colour graph of G, Ck(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k-colourings are joine...
Luis Cereceda, Jan van den Heuvel, Matthew Johnson
The present paper continues the study (begun by Quattrocchi, Colouring 4-cycle systems with specified block colour pattern: the case of embedding P3-designs, Electron. J. Combin.,...
Terry S. Griggs, Giovanni Lo Faro, Gaetano Quattro...
In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any ...
In this paper, we investigate cyclic sequences which contain as elements all k-subsets of {0, 1, . . . , n-1} exactly once such that the unions of any two consecutive k-subsets of...