On judicious partitions of graphs

DOI10.1007/s10878-015-9828-3zbMath1335.05095OpenAlexW1964440169MaRDI QIDQ281768

Muhuo Liu, Bao-Gang Xu

Publication date: 11 May 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9828-3

zbMATH Keywords

partitiongraphjudicious

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items (2)

Biased partitions and judicious \(k\)-partitions of graphs ⋮ Graph partitioning: an updated survey

Cites Work

• On judicious bisections of graphs
• Bisections of graphs
• A bound for judicious \(k\)-partitions of graphs
• A note on balanced bipartitions
• Judicious \(k\)-partitions of graphs
• Exact bounds for judicious partitions of graphs
• On minimum balanced bipartitions of triangle-free graphs
• Problems and results on judicious partitions
• Better Bounds for k-Partitions of Graphs
• Some Extremal Properties of Bipartite Subgraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On judicious partitions of graphs