This paper presents two partitioning schemes that guarantee connected copmonents given a connected initial grid. Connected components are important for convergence of methods such as domain decomposition or multigrid. For many of the grids tested, the schemes poduce partitions as good (in terms of number og cut edges) or better than spectral partitional resources. This paper describe the two schemes in detail and presents comparison results from a number of two and three dimensional unstructure grids