Pages that link to "Item:Q1126290"

The following pages link to Bipartite dimensions and bipartite degrees of graphs (Q1126290):

Displaying 25 items.

• Biclique covers and partitions (Q405095) (← links)
• Erdős-Pyber theorem for hypergraphs and secret sharing (Q497325) (← links)
• The micro-world of cographs (Q831855) (← links)
• Three ways to cover a graph (Q898135) (← links)
• On the decomposition of graphs into complete bipartite graphs (Q995755) (← links)
• Covering graphs with few complete bipartite subgraphs (Q1019181) (← links)
• Bipartite dimensions and bipartite degrees of graphs (Q1126290) (← links)
• Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs (Q1270816) (← links)
• Local and union boxicity (Q1709530) (← links)
• Determination of the star valency of a graph (Q1861579) (← links)
• Computational aspects of the 2-dimension of partially ordered sets (Q1884957) (← links)
• The saturation number of induced subposets of the Boolean lattice (Q2012537) (← links)
• Factoring a band matrix over a semiring (Q2041261) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• The biclique covering number of grids (Q2335697) (← links)
• Chromatic characterization of biclique covers (Q2368922) (← links)
• Transversals of Latin squares and covering radius of sets of permutations (Q2509702) (← links)
• A linear programming formulation for the maximum complete multipartite subgraph problem (Q2583129) (← links)
• Bi-objective optimization of biclustering with binary data (Q2666768) (← links)
• (Q4691844) (← links)
• (Q4691855) (← links)
• On Covering Numbers, Young Diagrams, and the Local Dimension of Posets (Q4990391) (← links)
• The Local Queue Number of Graphs with Bounded Treewidth (Q5014102) (← links)
• The Micro-world of Cographs (Q5041177) (← links)
• A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)