Pages that link to "Item:Q1910576"
From MaRDI portal
The following pages link to On edge perfectness and classes of bipartite graphs (Q1910576):
Displaying 24 items.
- A Gram classification of non-negative corank-two loop-free edge-bipartite graphs (Q272348) (← links)
- Generating bicliques of a graph in lexicographic order (Q557825) (← links)
- Edge cover by connected bipartite subgraphs (Q646717) (← links)
- On generalized perfect graphs: Bounded degree and bounded edge perfection (Q686267) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- Covering graphs with few complete bipartite subgraphs (Q1019181) (← links)
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs (Q1270816) (← links)
- On perfectly two-edge connected graphs (Q1363658) (← links)
- Computational aspects of the 2-dimension of partially ordered sets (Q1884957) (← links)
- A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games (Q1941537) (← links)
- Independent sets and hitting sets of bicolored rectangular families (Q2032357) (← links)
- Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes (Q2032702) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Efficient approximation for restricted biclique cover problems (Q2331611) (← links)
- Chromatic characterization of biclique covers (Q2368922) (← links)
- Biclique-Helly graphs (Q2478166) (← links)
- Jump Number of Two-Directional Orthogonal Ray Graphs (Q3009778) (← links)
- (Q4525747) (← links)
- (Q4691844) (← links)
- (Q4691855) (← links)
- (Q5026980) (← links)
- ON AN INVARIANT FOR THE PROBLEM OF UNDERDETERMINED DATA DECOMPOSING (Q5151198) (← links)
- Covering Graphs with Few Complete Bipartite Subgraphs (Q5458846) (← links)
- Modeling combinatorial disjunctive constraints via junction trees (Q6120845) (← links)
