Pages that link to "Item:Q5302053"
From MaRDI portal
The following pages link to On Independent Sets and Bicliques in Graphs (Q5302053):
Displaying 24 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Bicolored independent sets and bicliques (Q436317) (← links)
- Generating bicliques of a graph in lexicographic order (Q557825) (← links)
- Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
- A new decomposition technique for maximal clique enumeration for sparse graphs (Q1740688) (← links)
- Exact exponential-time algorithms for finding bicliques (Q1944039) (← links)
- Covering and packing in linear space (Q1944195) (← links)
- Efficient enumeration of maximal induced bicliques (Q1983137) (← links)
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
- On bicliques and the second clique graph of suspensions (Q2184693) (← links)
- A note on bipartite subgraphs and triangle-independent sets (Q2374154) (← links)
- On independent sets and bicliques in graphs (Q2428684) (← links)
- Enumerating maximal bicliques in bipartite graphs with favorable degree sequences (Q2446577) (← links)
- A convexity upper bound for the number of maximal bicliques of a bipartite graph (Q2448895) (← links)
- Computing \(k\)-independent sets for regular bipartite graphs (Q2717906) (← links)
- Counting Maximal Independent Sets in Subcubic Graphs (Q2891379) (← links)
- On co-bicliques (Q3004204) (← links)
- (Q4591099) (← links)
- (Q4691855) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
- (Q5397250) (← 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)
- Bicliques in graphs. I: Bounds on their number (Q5932702) (← links)
