The following pages link to The biparticity of a graph (Q4154589):
Displaying 24 items.
- Covering digraphs with small indegrees or outdegrees by directed cuts (Q389984) (← links)
- Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts (Q418854) (← links)
- Covering complete hypergraphs with cuts of minimum total size (Q659756) (← links)
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices (Q802577) (← links)
- On the biclique cover of the complete graph (Q897237) (← links)
- On the decomposition of graphs into complete bipartite graphs (Q995755) (← links)
- Balanced decompositions of a signed graph (Q1092068) (← links)
- Local \(k\)-colorings of graphs and hypergraphs (Q1095156) (← links)
- Minimum-maximal matching in series-parallel graphs (Q1099085) (← links)
- Decompositions of complete multigraphs related to Hadamard matrices (Q1268621) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Coloring temporal graphs (Q2237899) (← links)
- On fractional cut covers (Q2312658) (← links)
- Chromatic characterization of biclique covers (Q2368922) (← links)
- A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes (Q2672548) (← links)
- Degree Ramsey Numbers of Graphs (Q2883865) (← links)
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs (Q3797213) (← links)
- (Q3879256) (← links)
- (Q4691789) (← links)
- (Q4691855) (← links)
- ON THE DICHROMATIC INDEX OF A DIGRAPH (Q4886303) (← links)
- Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs (Q5163156) (← links)
- Covering Complete <i>r</i>-Graphs with Spanning Complete <i>r</i>-Partite <i>r</i>-Graphs (Q5199506) (← links)
- Sphere-of-influence graphs using the sup-norm (Q5927945) (← links)
