Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover

Abstract

This paper presents minimal construction techniques of a new graph class called Ferrer-esque [10] comes from Ferrers relation [9] on path and cycle graphs by using set cover method. The minimal constructions provide to obtain a Ferrer-esque graph by adding minimum number of edges to paths and cycles. We also state some open problems about Ferrer-Esque graphs to the readers.

Keywords

• Graph algorithms,factorization,matching,partitioning,covering and packing,Paths and cycles.

References

1. Andrews, G. E., The Theory of Partitions, Cambridge, England: Cambridge University Press, pp. 6-7, 1998.