On decomposition of triangle-free graphs under degree constraints
Atsushi Kaneko · Journal of Graph Theory · 1998
We prove that if s and t are positive integers and if G is a triangle-free graph with minimum degree s + t, then the vertex set of G has a decomposition into two sets which induce subgraphs of minimum degree at least s and t, respectively. © 1998 John Wiley & Sons, Inc. J Graph Theory 27: 7–9, 1998