Pages that link to "Item:Q5932702"
From MaRDI portal
The following pages link to Bicliques in graphs. I: Bounds on their number (Q5932702):
Displayed 28 items.
- Mod/Resc parsimony inference: theory and application (Q418168) (← links)
- The graph formulation of the union-closed sets conjecture (Q458600) (← links)
- Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- Generating bicliques of a graph in lexicographic order (Q557825) (← links)
- Almost every graph is divergent under the biclique operator (Q908300) (← links)
- On the determination problem for \(P_{4}\)-transformation of graphs (Q1015433) (← links)
- Complexity of learning in concept lattices from positive and negative examples (Q1878406) (← links)
- Recognizing \(k\)-path graphs (Q1962042) (← links)
- Efficient enumeration of maximal induced bicliques (Q1983137) (← links)
- On computing the Galois lattice of bipartite distance hereditary graphs (Q2357768) (← links)
- On independent sets and bicliques in graphs (Q2428684) (← links)
- A convexity upper bound for the number of maximal bicliques of a bipartite graph (Q2448895) (← links)
- Biclique-Helly graphs (Q2478166) (← links)
- NP-completeness results for edge modification problems (Q2500532) (← links)
- On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs (Q2633284) (← links)
- A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals (Q2700612) (← links)
- (Q4691855) (← links)
- (Q5026980) (← links)
- On Problem of Finding all Maximal Induced Bicliques of Hypergraph (Q5071398) (← links)
- DECOMPOSITIONAL APPROACH TO RESEARCH OF FORMAL CONTEXTS (Q5151269) (← links)
- Biclique graphs and biclique matrices (Q5189236) (← links)
- On Independent Sets and Bicliques in Graphs (Q5302053) (← links)
- Tight lower bounds on the number of bicliques in false-twin-free graphs (Q5890720) (← links)
- Tight lower bounds on the number of bicliques in false-twin-free graphs (Q5890936) (← links)
- On the generation of bicliques of a graph (Q5899361) (← links)
- On the generation of bicliques of a graph (Q5919931) (← links)
- On the edge‐biclique graph and the iterated edge‐biclique operator (Q6081559) (← links)