A bound for judicious k-partitions of graphs

DOI10.1016/J.DAM.2014.07.002zbMATH Open1303.05152OpenAlexW2044253309MaRDI QIDQ477337FDOQ477337

Authors Qinghou Zeng, Genghua Fan, Jianfeng 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

judicious partitionswitchingmax-cut problem

Mathematics Subject Classification ID

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

Recommendations

• Judicious \(k\)-partitions of graphs
• Bounds for pairs in judicious partitioning of graphs
• On a problem of judicious \(k\)-partitions of graphs
• On judicious partitions of graphs
• Biased partitions and judicious \(k\)-partitions of graphs

Cites work

• scientific article; zbMATH DE number 637304 (Why is no real title available?)
• scientific article; zbMATH DE number 1787231 (Why is no real title available?)
• Better bounds for \(k\)-partitions of graphs
• Bipartite density of triangle-free subcubic graphs
• Bipartite subgraphs
• Exact bounds for judicious partitions of graphs
• Judicious \(k\)-partitions of graphs
• Node-and edge-deletion NP-complete problems
• Problems and results on judicious partitions
• Some Extremal Properties of Bipartite Subgraphs
• Triangle-free subcubic graphs with minimum bipartite density

Cited in

(23)

• Balanced judicious bipartition is fixed-parameter tractable
• On judicious partitions of uniform hypergraphs
• An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
• Judicious \(k\)-partitions of graphs
• Judicious partitions of bounded‐degree graphs
• On Bounds for the k-Partitioning of Graphs
• On bisections of graphs without complete bipartite graphs
• Bounds for pairs in judicious partitioning of graphs
• Maximum cuts of graphs with forbidden cycles
• On judicious partitions of graphs
• Judicious partitioning of hypergraphs with edges of size at most 2
• Better bounds for \(k\)-partitions of graphs
• Partitioning dense uniform hypergraphs
• Exact bounds for judicious partitions of graphs
• The Bollobás-Scott conjecture for 4-uniform hypergraphs
• Bounds for pairs in partitions of graphs
• Judicious partitions and related problems
• On a problem of judicious \(k\)-partitions of graphs
• Maximum cuts in \(\mathscr{H} \)-free graphs
• Graph partitioning: an updated survey
• Biased partitions and judicious \(k\)-partitions of graphs
• On judicious bipartitions of directed graphs
• A note on \(k\)-partitions of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477337)