On minimum balanced bipartitions of triangle-free graphs

DOI10.1007/s10878-012-9539-yzbMath1297.90139OpenAlexW2002944328MaRDI QIDQ2015796

Hai-yan Li, Yanting Liang, Muhuo Liu, Bao-Gang 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)

Related Items (3)

On judicious partitions of graphs ⋮ Partitioning dense uniform hypergraphs ⋮ MAXIMUM BALANCED 3-PARTITIONS OF GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bounds on minimum balanced bipartitions
• Bisections of graphs
• A note on balanced bipartitions
• Some simplified NP-complete graph problems
• Problems and results on judicious partitions
• The Factorization of Linear Graphs

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