The biparticity of a graph
From MaRDI portal
Publication:4154589
Cited in
(24)- Coloring temporal graphs
- Covering complete \(r\)-graphs with spanning complete \(r\)-partite \(r\)-graphs
- Decompositions of complete multigraphs related to Hadamard matrices
- A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- An overview of graph covering and partitioning
- Covering digraphs with small indegrees or outdegrees by directed cuts
- Chromatic characterization of biclique covers
- ON THE DICHROMATIC INDEX OF A DIGRAPH
- scientific article; zbMATH DE number 3683613 (Why is no real title available?)
- Sphere-of-influence graphs using the sup-norm
- Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts
- On the biclique cover of the complete graph
- Addressing Johnson graphs, complete multipartite graphs, odd cycles, and random graphs
- On the decomposition of graphs into complete bipartite graphs
- Balanced decompositions of a signed graph
- Computation of the biclique partition number for graphs with specific blocks
- Problems and invariants connected with bicliques and multicliques of graphs
- On fractional cut covers
- Covering complete hypergraphs with cuts of minimum total size
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
- Minimum-maximal matching in series-parallel graphs
- Degree Ramsey numbers of graphs
- Local \(k\)-colorings of graphs and hypergraphs
This page was built for publication: The biparticity of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154589)
