The　fractional　arboricity　of　a　graph　G,　denoted　by　γf(G),　is　defined　as　γf(G)=maxH⊆G,v(H)>1⁡[Formula　presented].　The　famous　Nash–Williams　Theorem　states　that　a　graph　G　can　be　partitioned　into　at　most　k　forests　if　and　only　if　γf(G)≤k.　A　graph　is　d-bounded　if　it　has　maximum　degree　at　most　d.　The　Nine　Dragon　Tree　(NDT)　Conjecture　[posed　by　Montassier,　Ossona　de　Mendez,　Raspaud,　and　Zhu,　at　[11]]　asserts　that　if　γf(G)≤k+[Formula　presented],　then　G　decomposes　into　k+1　forests　with　one　being　d-bounded.　In　this　paper,　it　is　proven　that　the　Nine　Dragon　Tree　Conjecture　is　true　for　all　the　cases　in　which　d=1.　©　2018　Elsevier　Inc.