Daniela Kühn, Deryk Osthus. Partitions of graphs with high minimum degree or connectivity. Journal of Combinatorial Theory, Series A, 88(1):29-43, 2003. [doi]
@article{KuhnO03,
title = {Partitions of graphs with high minimum degree or connectivity},
author = {Daniela Kühn and Deryk Osthus},
year = {2003},
doi = {10.1016/S0095-8956(03)00028-5},
url = {http://dx.doi.org/10.1016/S0095-8956(03)00028-5},
tags = {graph-rewriting, rewriting, partitioning},
researchr = {https://researchr.org/publication/KuhnO03},
cites = {0},
citedby = {0},
journal = {Journal of Combinatorial Theory, Series A},
volume = {88},
number = {1},
pages = {29-43},
}