Buscar
Mostrando ítems 1-9 de 9
Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
(Discrete Mathematics And Theoretical Computer Science, 2013-01)
A biclique is a set of vertices that induce a complete bipartite graph. A graph G is biclique-Helly when its family of maximal bicliques satisfies the Helly property. If every induced subgraph of G is also biclique-Helly, ...
On star and biclique edge-colorings
(Wiley, 2017-01)
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 bipartite graph K1,q. ...
A note on a Maximum k-Subset Intersection problem
(Elsevier Science BvAmsterdamHolanda, 2012)