\input zb-basic \input zb-ioport \iteman{io-port 05919732} \itemau{Fujita, Shinya; Liu, Henry} \itemti{Further results on the balanced decomposition number.} \itemso{Congr. Numerantium 202, 119-128 (2010).} \itemab Summary: A balanced colouring of a graph $G$ is a colouring of some of the vertices of $G$ with two colours, say red and blue, such that there is the same number of vertices in each colour. The balanced decomposition number $f(G)$ of $G$ is the minimum integer $s$ with the following property: For any balanced colouring of $G$, there is a partition $V(G)= V_1\dot\cup\cdots\dot\cup V_r$ such that, for every $1\le i\le r$, $V_i$ induces a connected subgraph of order at most $s$, and contains the same number of red and blue vertices. The function $f(G)$ was introduced by {\it S. Fujita} and {\it T. Nakamigawa} [(*) Discrete Appl. Math. 156, No. 18, 3339--3344 (2008; Zbl 1178.05075)], and was further studied by {\it S. Fujita} and {\it H. Liu} [(**) SIAM J. Discrete Math. 24, No. 4, 1597--1616 (2010; Zbl 1222.05210) and (***) The balanced decomposition number of $TK_4$ and series-parallel graphs (submitted)]. In [(*)], {\it S. Fujita} and {\it T. Nakamigawa} conjectured that $f(G)\le\lfloor{n\over 2}\rfloor+1$ if $G$ is a 2-connected graph on $n$ vertices. Partial results of this conjecture have been proved in [(*), (**), (***)]. In this paper, we shall prove another partial result, in the case when the number of coloured vertices is six. We shall also derive some consequences from known results about the balanced decomposition number and other results. \itemrv{~} \itemcc{} \itemut{} \itemli{} \end