Let $G$ be a simple graph with order $n$, maximum degree $Δ(G)$, and chromatic index $χ'(G)$, respectively. A graph $G$ is edge-chromatic critical if $χ'(H)<χ'(G)$ for every proper subgraph $H$ of $G$. Assume that $G$ is an $n$-vertex connected regular Class $1$ graph, and let $G^*$ be obtained from $G$ by splitting one vertex into two vertices. Hilton and Zhao in 1997 proposed the vertex-splitting conjecture: if $Δ(G)>\frac{n}{3}$, then $G^*$ is edge-chromatic critical. Recently, Cao, Chen, and Shan (Discrete Math. 2022) verified the conjecture for $Δ(G)\ge\frac{3n}{4}$. In this paper, we confirm the conjecture for $Δ(G) \ge\frac{2n-2}{3}$.