A New Polynomial-Time Solvable Graph Class for the Minimum Biclique Edge Cover Problem

抄録

The minimum biclique edge cover problem (MBECP) is NP-hard for general graphs. It is known that if we restrict an input graph to the bipartite domino-free class, MBECP can be solved within polynomial-time of input graph size. We show a new polynomial-time solvable graph class for MBECP that is characterized by three forbidden graphs, a domino, a gem and K₄. This graph class allows that an input graph is non-bipartite, and includes the bipartite domino-free graph class properly.