We introduce a new statistic on linear and circular r-mino arrangements which leads to interesting polynomial generalizations of the r-Fibonacci and r-Lucas sequences. By studying...
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number o...
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nak...
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...