Coverings by minimal transversals

Abstract In this paper, we give counterexamples to the conjecture: “ Every nonempty regular simple graph contains two disjoint maximal independent sets ” [2, 7]. For this, we generalize this problem to the following: covering the set of vertices of a graph by minimal transversals. An equivalence of this last problem is given.

[1]  Stephen T. Hedetniemi,et al.  Disjoint independent dominating sets in graphs , 1976, Discret. Math..

[2]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[3]  Branko Grünbaum,et al.  Matchings in polytopal graphs , 1974, Networks.

[4]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .