Let $G$ be a graph of order $n$. The maximum and minimum degree of $G$ are denoted by $\Delta$ and $\delta$ respectively. The \emph{path partition number} $\mu (G)$ of a graph $G$ is the minimum number of paths needed to partition the vertices of $G$. Magnant, Wang and Yuan conjectured that $\mu (G)\leq \max \left \{ \frac{n}{\delta +1}, \frac{\left( \Delta -\delta \right) n}{\left( \Delta +\delta \right) }\right \} .$ In this work, we give a positive answer to this conjecture, for $ \Delta \geq 2 \delta $.\medskip \end{abstract}

翻译：$G$ 是一个顺序图 $n 。 $G$ 的最大和最小值分别为 $\ Delta$ 和 $delta$。 图形$G$ 的 emph{ pathspide number} $\ mu (G) $ G$ 是分割 $G$ 的顶点所需的最低路径数 。 Magnant、 Wang 和 元 预测$\ muleq\ max\ leta left {\ frac{n\ delta+1},\ frac\ left (\ Delta -\ delta\ right) n\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\