### Abstract

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,...,V_r} such that, for every i, 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 Fujita and Nakamigawa in 2008. They conjectured that f(G) ≤ ⌊n/2⌋ + 1 if G is a 2-connected graph on n vertices. In this paper, we shall prove two partial results, in the cases when G is a subdivided K_4, and a 2-connected series-parallel graph.

Original language | Unknown |
---|---|

Pages (from-to) | 347-359 |

Journal | Discussiones Mathematicae Graph Theory |

Volume | 33 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1 Jan 2013 |