The biparticity of a graph

DOI10.1002/jgt.3190010208zbMath0376.05043OpenAlexW1997890669MaRDI QIDQ4154589

Zevi Miller, Derbiau F. Hsu, Frank Harary

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (24)

Degree Ramsey Numbers of Graphs ⋮ Chromatic characterization of biclique covers ⋮ Balanced decompositions of a signed graph ⋮ Local \(k\)-colorings of graphs and hypergraphs ⋮ An overview of graph covering and partitioning ⋮ Minimum-maximal matching in series-parallel graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Covering digraphs with small indegrees or outdegrees by directed cuts ⋮ Unnamed Item ⋮ A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes ⋮ On the biclique cover of the complete graph ⋮ Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts ⋮ ON THE DICHROMATIC INDEX OF A DIGRAPH ⋮ Covering complete hypergraphs with cuts of minimum total size ⋮ Coloring temporal graphs ⋮ Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs ⋮ Sphere-of-influence graphs using the sup-norm ⋮ Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs ⋮ On the decomposition of graphs into complete bipartite graphs ⋮ Decompositions of complete multigraphs related to Hadamard matrices ⋮ On fractional cut covers ⋮ Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs ⋮ Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices

Cites Work

• On Partitioning Planar Graphs
• COVERING AND PACKING IN GRAPHS, I.

This page was built for publication: The biparticity of a graph