A biclique of a graph G is an induced complete bipartite graph. A star of G is a biclique contained in the closed neighborhood of a vertex. A star (biclique) k-coloring of G is a k-coloring of G thatâ€¦ (More)

A biclique of a graph G is a maximal induced complete bipartite subgraph of G. Given a graph G, the biclique matrix of G is a {0,1,âˆ’1} matrix having one row for each biclique and one column for eachâ€¦ (More)

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â€¦ (More)

We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the correspondingâ€¦ (More)

A biclique is a maximal bipartite complete induced subgraph of G. The biclique graph of a graph G, denoted by KB(G), is the intersection graph of the family of all bicliques of G. In this work weâ€¦ (More)

A graph G is clique-perfect if the cardinality of a maximum cliqueindependent set of H is equal to the cardinality of a minimum cliquetransversal of H , for every induced subgraph H of G. Whenâ€¦ (More)

The biclique graph of G, KB(G), is the intersection graph of the bicliques of G. Given a graph G, the iterated biclique graph of G, KBk(G), is the graph defined iteratively as follows: KBk+1(G) =â€¦ (More)

A biclique of G is a maximal set of vertices that induces a complete bipartite subgraph Kp,q of G with at least one edge, and a star of a graph G is a maximal set of vertices that induces a completeâ€¦ (More)