On minimum balanced bipartitions of triangle-free graphs

DOI10.1007/S10878-012-9539-YzbMATH Open1297.90139OpenAlexW2002944328MaRDI QIDQ2015796FDOQ2015796

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

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

zbMATH Keywords

planar graphstriangle-free graphsbalanced bipartition

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• The Factorization of Linear Graphs
• Some simplified NP-complete graph problems
• Bisections of graphs
• Problems and results on judicious partitions
• A note on balanced bipartitions
• Title not available (Why is that?)
• Upper bounds on minimum balanced bipartitions

Cited In (10)

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

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)