Journal of Graph Theory · 2000 · 31 citations · 4 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsComputational GeometryGraph AlgorithmsGraph TheoryComputational Complexity Of Graph AlgorithmsDegree ReductionGraph DecompositionsGraph Theory Models
We prove that the vertex set of a simple graph with minimum degree at least s + t − 1 and girth at least 5 can be decomposed into two parts, which induce subgraphs with minimum degree at least s and t, respectively, where s, t are positive integers ≥ 2. © 2000 John Wiley & Sons, Inc: J Graph Theory 33: 237–239, 2000
4
Decomposing graphs under degree constraints
Michael Stiebitz · Journal of Graph Theory · 1996 · 77 citations
Decomposing graphs under degree constraints
Michael Stiebitz · Journal of Graph Theory · 1996 · 75 citations