Better bounds for k-partitions of graphs

DOI10.1017/S0963548311000204zbMATH Open1223.05245MaRDI QIDQ5199512FDOQ5199512

Authors: Xingxing Yu, Baogang Xu 

Publication date: 16 August 2011

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

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

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

• Exact bounds for judicious partitions of graphs
• Problems and results on judicious partitions
• Some Extremal Properties of Bipartite Subgraphs
• Judicious \(k\)-partitions of graphs
• Title not available (Why is that?)

Cited In (30)

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