On minimum balanced bipartitions of triangle-free graphs

DOI10.1007/S10878-012-9539-YMaRDI QIDQ2015796zbMATH OpenOpenAlexFDO

Authors Haiyan Li, Yanting Liang, Muhuo Liu, Baogang Xu

Publication date 24 June 2014

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-012-9539-y

zbMATH Keywords

planar graphstriangle-free graphsbalanced bipartition

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• Upper bounds on minimum balanced bipartitions
• Minimum balanced bipartitions of planar triangulations
• Balanced judicious bipartitions of graphs
• A note on balanced bipartitions
• Upper bounds on minimum balanced bipartition of Hamilton plane graphs

Cites work

• scientific article; zbMATH DE number 1929926 (Why is no real title available?)
• A note on balanced bipartitions
• Bisections of graphs
• Graph theory
• Problems and results on judicious partitions
• Some simplified NP-complete graph problems
• The Factorization of Linear Graphs
• Upper bounds on minimum balanced bipartitions

Cited in

(10)

• Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
• Upper bounds on minimum balanced bipartitions
• Forcing unbalanced complete bipartite minors
• Maximum balanced 3-partitions of graphs
• On judicious partitions of graphs
• Minimal clique partitions and pairwise balanced designs
• Upper bounds on minimum balanced bipartitions of plane graphs
• Minimum balanced bipartitions of planar triangulations
• Upper bounds on minimum balanced bipartition of Hamilton plane graphs
• Partitioning dense uniform hypergraphs

This page was built for publication: On minimum balanced bipartitions of triangle-free graphs

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