Better bounds for k-partitions of graphs

DOI10.1017/S0963548311000204MaRDI QIDQ5199512zbMATH OpenFDO

Authors Xingxing Yu, Baogang Xu

Publication date 16 August 2011

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548311000204

Mathematics Subject Classification ID

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

Recommendations

• A note on k-partitions of graphs
• Bounds for pairs in partitions of graphs
• On judicious partitions of graphs
• A bound for judicious \(k\)-partitions of graphs
• Graph partitions. II

Cites work

• Exact bounds for judicious partitions of graphs
• scientific article; zbMATH DE number 1787226 (Why is no real title available?)
• Judicious \(k\)-partitions of graphs
• Problems and results on judicious partitions
• Some Extremal Properties of Bipartite Subgraphs

Cited in

(30)

• Partitioning dense uniform hypergraphs
• Bounds for judicious balanced bipartitions of graphs
• On bipartitions of directed graphs with small semidegree
• Maximum bipartite subgraphs in graphs without short cycles
• On judicious bipartitions of directed graphs
• Maximum cuts in \(\mathscr{H} \)-free graphs
• On problems about judicious bipartitions of graphs
• Biased partitions and judicious \(k\)-partitions of graphs
• On judicious partitions of graphs
• Judicious partitions of weighted hypergraphs
• Bounds for pairs in judicious partitioning of graphs
• A note on k-partitions of graphs
• On judicious bisections of graphs
• Upper bounds on minimum balanced bipartitions
• Bisections of graphs without short cycles
• The Bollobás-Scott conjecture for 4-uniform hypergraphs
• Maximum cuts of graphs with forbidden cycles
• A bound for judicious \(k\)-partitions of graphs
• On a graph partition result of Kűhn and Osthus.
• An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
• On Bounds for the k-Partitioning of Graphs
• On a problem of judicious k-partitions of graphs
• On judicious bipartitions of graphs
• Partitioning digraphs with outdegree at least 4
• Graph partitioning: an updated survey
• Optimal bisections of directed graphs
• Counting connected partitions of graphs
• Simple probabilistic analysis to generalize bottleneck graph multi-partitioning
• Bipartitions of oriented graphs
• Bounds for pairs in partitions of graphs

This page was built for publication: Better bounds for \(k\)-partitions of graphs

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