(1) Facultad de Ciencias Exáctas y Naturales, Departamento de Computación, Universidad de Buenos Aires, Argentina;(2) Instituto de Matemática, NCE and COPPE, Universidade Federal do Rio de Janeiro, Brasil
Abstract:
A graph is biclique-Helly when its family of (maximal) bicliques is a Helly family. We describe characterizations for biclique-Helly
graphs, leading to polynomial time recognition algorithms. In addition, we relate biclique-Helly graphs to the classes of
clique-Helly, disk-Helly and neighborhood-Helly graphs.