Tight lower bounds on the number of bicliques in false-twin-free graphs
From MaRDI portal
Publication:5890720
DOI10.1016/j.tcs.2016.05.027zbMath1342.05089OpenAlexW2962899930MaRDI QIDQ5890720
Leandro Montero, Marina Groshaus
Publication date: 1 June 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.027
Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Cites Work
- Unnamed Item
- Generating bicliques of a graph in lexicographic order
- Consensus algorithms for the generation of all maximal bicliques
- Enumeration aspects of maximal cliques and bicliques
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- Arboricity and bipartite subgraph listing algorithms
- Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
- On the Iterated Biclique Operator
- On Independent Sets and Bicliques in Graphs
- Algorithm Theory - SWAT 2004
- Algorithm Theory - SWAT 2004
- Tight lower bounds on the number of bicliques in false-twin-free graphs
- Bicliques in graphs. I: Bounds on their number