The biparticity of a graph
From MaRDI portal
Publication:4154589
DOI10.1002/JGT.3190010208zbMATH Open0376.05043OpenAlexW1997890669MaRDI QIDQ4154589FDOQ4154589
Frank Harary, Z. Miller, Derbiau F. Hsu
Publication date: 1977
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190010208
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Cites Work
Cited In (24)
- An overview of graph covering and partitioning
- Balanced decompositions of a signed graph
- Minimum-maximal matching in series-parallel graphs
- Degree Ramsey numbers of graphs
- Chromatic characterization of biclique covers
- ON THE DICHROMATIC INDEX OF A DIGRAPH
- Decompositions of complete multigraphs related to Hadamard matrices
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- On the decomposition of graphs into complete bipartite graphs
- Title not available (Why is that?)
- Coloring temporal graphs
- Covering digraphs with small indegrees or outdegrees by directed cuts
- Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts
- Local \(k\)-colorings of graphs and hypergraphs
- On the biclique cover of the complete graph
- Title not available (Why is that?)
- Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs
- Title not available (Why is that?)
- A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
- Sphere-of-influence graphs using the sup-norm
- Covering complete hypergraphs with cuts of minimum total size
- Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs
- On fractional cut covers
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)
