In this paper we deal a classical problem, degree restricted spanning trees for series-parallel graph. Our general goal is to prove the NP-completeness of restricted degree spanning trees for ...

A "three-terminal series-parallel graph" is defined to be a three-terminal graph which is constructed by means of repeating only specified series and parallel connections. This definition is based ...