Bicliques in graphs. I: Bounds on their number
From MaRDI portal
Publication:5932702
DOI10.1007/S004930070035zbMATH Open0980.05033OpenAlexW2016785496MaRDI QIDQ5932702FDOQ5932702
Authors: Erich Prisner 
Publication date: 13 June 2001
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930070035
Recommendations
Cited In (34)
- On Independent Sets and Bicliques in Graphs
- On bicliques, biclique partitions and related classes of cographs
- On the biclique partition of the corona and joins of graphs
- Biclique-Helly graphs
- NP-completeness results for edge modification problems
- Mod/Resc parsimony inference: theory and application
- Title not available (Why is that?)
- On problem of finding all maximal induced bicliques of hypergraph
- On the determination problem for \(P_{4}\)-transformation of graphs
- Generating bicliques of a graph in lexicographic order
- On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs
- On edge-sets of bicliques in graphs
- On the generation of bicliques of a graph
- Tight lower bounds on the number of bicliques in false-twin-free graphs
- Tight lower bounds on the number of bicliques in false-twin-free graphs
- Biclique graphs and biclique matrices
- On the generation of bicliques of a graph
- Recognizing \(k\)-path graphs
- Complexity of learning in concept lattices from positive and negative examples
- Almost every graph is divergent under the biclique operator
- Problems and invariants connected with bicliques and multicliques of graphs
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- Biclique-colouring verification complexity and biclique-colouring power graphs
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs
- Efficient enumeration of maximal induced bicliques
- On computing the Galois lattice of bipartite distance hereditary graphs
- On bicliques and the second clique graph of suspensions
- On the edge‐biclique graph and the iterated edge‐biclique operator
- Decompositional approach to research of formal contexts
- Enumeration aspects of maximal cliques and bicliques
- A convexity upper bound for the number of maximal bicliques of a bipartite graph
- A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals
- Structural properties of biclique graphs and the distance formula
- On independent sets and bicliques in graphs
This page was built for publication: Bicliques in graphs. I: Bounds on their number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5932702)
