Pages that link to "Item:Q1019181"
From MaRDI portal
The following pages link to Covering graphs with few complete bipartite subgraphs (Q1019181):
Displaying 32 items.
- Mod/Resc parsimony inference: theory and application (Q418168) (← links)
- The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
- Edge cover by connected bipartite subgraphs (Q646717) (← links)
- Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- Coloring problems on bipartite graphs of small diameter (Q831342) (← links)
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs (Q1270816) (← links)
- VNS matheuristic for a bin packing problem with a color constraint (Q1687630) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- Coherent network partitions (Q2026346) (← links)
- Disconnected cuts in claw-free graphs (Q2186821) (← links)
- Coherent network partitions: characterizations with cographs and prime graphs (Q2243575) (← links)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- On disconnected cuts and separators (Q2275942) (← links)
- Efficient approximation for restricted biclique cover problems (Q2331611) (← links)
- Chromatic characterization of biclique covers (Q2368922) (← links)
- Packing bipartite graphs with covers of complete bipartite graphs (Q2442206) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Algorithms for finding biclique covers of graphs with bounded pathwidth (Q2906901) (← links)
- Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees (Q3007632) (← links)
- (Q4034791) (← links)
- Bipartite Coverings of Graphs (Q4354593) (← links)
- (Q4691855) (← links)
- (Q4691865) (← links)
- (Q5005143) (← links)
- (Q5009627) (← links)
- ON AN INVARIANT FOR THE PROBLEM OF UNDERDETERMINED DATA DECOMPOSING (Q5151198) (← links)
- (Q6068263) (← links)
- Order-sensitive domination in partially ordered sets and graphs (Q6105038) (← links)
- Transforming quantified Boolean formulas using biclique covers (Q6536143) (← links)
- Asymmetry in the complexity of the multi-commodity network pricing problem (Q6634531) (← links)
