Pages that link to "Item:Q2368922"
From MaRDI portal
The following pages link to Chromatic characterization of biclique covers (Q2368922):
Displaying 10 items.
- Edge cover by connected bipartite subgraphs (Q646717) (← links)
- Covering graphs with few complete bipartite subgraphs (Q1019181) (← links)
- Minimal arc-sets spanning dicycles (Q1707911) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- On computing the Galois lattice of bipartite distance hereditary graphs (Q2357768) (← links)
- A linear programming formulation for the maximum complete multipartite subgraph problem (Q2583129) (← links)
- On co-bicliques (Q3004204) (← links)
- (Q4691855) (← links)
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
- Covering Graphs with Few Complete Bipartite Subgraphs (Q5458846) (← links)