On minimum balanced bipartitions of triangle-free graphs

Haiyan Li (), Yanting Liang (), Muhuo Liu () and Baogang Xu ()
Additional contact information
Haiyan Li: Nanjing Normal University
Yanting Liang: University of Wisconsin–Fond du Lac
Muhuo Liu: Nanjing Normal University
Baogang Xu: Nanjing Normal University

Journal of Combinatorial Optimization, 2014, vol. 27, issue 3, No 11, 557-566

Abstract: Abstract A balanced bipartition of a graph G is a partition of V(G) into two subsets V 1 and V 2 that differ in cardinality by at most 1. A minimum balanced bipartition of G is a balanced bipartition V 1, V 2 of G minimizing e(V 1,V 2), where e(V 1,V 2) is the number of edges joining V 1 and V 2 and is usually referred to as the size of the bipartition. In this paper, we show that every 2-connected graph G admits a balanced bipartition V 1,V 2 such that the subgraphs of G induced by V 1 and by V 2 are both connected. This yields a good upper bound to the size of minimum balanced bipartition of sparse graphs. We also present two upper bounds to the size of minimum balanced bipartitions of triangle-free graphs which sharpen the corresponding bounds of Fan et al. (Discrete Math. 312:1077–1083, 2012).

Keywords: Balanced bipartition; Triangle-free graphs; Planar graphs (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9539-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:27:y:2014:i:3:d:10.1007_s10878-012-9539-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9539-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().