Balanced decompositions of a signed graph

DOI10.1016/0095-8956(87)90026-8zbMath0624.05056OpenAlexW2103775950MaRDI QIDQ1092068

Thomas Zaslavsky

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90026-8

zbMATH Keywords

balanced decomposition numberbalanced decompositionsbalanced partition numberstructural properties of signed graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (4)

A modeling and computational study of the frustration index in signed networks ⋮ Efficient enumeration of the optimal solutions to the correlation clustering problem ⋮ Ising formulations of some graph-theoretic problems in psychological research: models and methods ⋮ Frustration and isoperimetric inequalities for signed graphs

Cites Work

• Unnamed Item
• How colorful the signed graph?
• Signed graph coloring
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• The biparticity of a graph
• Bounded color functions on graphs

This page was built for publication: Balanced decompositions of a signed graph