A bound for judicious \(k\)-partitions of graphs

DOI10.1016/J.DAM.2014.07.002zbMath1303.05152OpenAlexW2044253309MaRDI QIDQ477337

Qinghou Zeng, Geng-Hua Fan, Jian-Feng Hou

Publication date: 3 December 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.07.002

zbMATH Keywords

switchingmax-cut problemjudicious partition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (13)

On judicious partitions of uniform hypergraphs ⋮ On judicious partitions of graphs ⋮ Biased partitions and judicious \(k\)-partitions of graphs ⋮ On judicious bipartitions of directed graphs ⋮ Bounds for pairs in judicious partitioning of graphs ⋮ On bisections of graphs without complete bipartite graphs ⋮ Graph partitioning: an updated survey ⋮ Partitioning dense uniform hypergraphs ⋮ The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs ⋮ Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 ⋮ Maximum cuts of graphs with forbidden cycles ⋮ Maximum cuts in \(\mathscr{H} \)-free graphs ⋮ On a Problem of Judiciousk-Partitions of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Judicious \(k\)-partitions of graphs
• Bipartite density of triangle-free subcubic graphs
• Exact bounds for judicious partitions of graphs
• Triangle-free subcubic graphs with minimum bipartite density
• Bipartite subgraphs
• Problems and results on judicious partitions
• Better Bounds for k-Partitions of Graphs
• Node-and edge-deletion NP-complete problems
• Some Extremal Properties of Bipartite Subgraphs

This page was built for publication: A bound for judicious \(k\)-partitions of graphs