A bound for judicious k-partitions of graphs

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

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

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

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)

Cites Work

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

Cited In (18)

• On Bounds for the k-Partitioning of Graphs
• On bisections of graphs without complete bipartite graphs
• An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
• On judicious partitions of uniform hypergraphs
• Judicious partitions of bounded‐degree graphs
• On judicious partitions of graphs
• Judicious Partitioning of Hypergraphs with Edges of Size at Most 2
• The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs
• Graph partitioning: an updated survey
• Biased partitions and judicious \(k\)-partitions of graphs
• Bounds for pairs in partitions of graphs
• Maximum cuts of graphs with forbidden cycles
• Exact bounds for judicious partitions of graphs
• On a Problem of Judiciousk-Partitions of Graphs
• On judicious bipartitions of directed graphs
• Maximum cuts in \(\mathscr{H} \)-free graphs
• Bounds for pairs in judicious partitioning of graphs
• Partitioning dense uniform hypergraphs

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)